Locally orientable graphs, cell structures, and a new algorithm for the incremental maintenance of connectivity carcasses

Ye Dinitz, A. Vainshtein

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

6 Scopus citations

Abstract

Let G - [V, E) be an undirected graph, S be a subset of its vertices. The concept of the connectivity carcass of S has been introduced by the authors at STOC'94; it provides a tool for studying i-edge-connectivity. In this paper we: (i) suggest and study a new type of graphs, locally orientable graphs, which generalize digraphs and provide a concise description of the connectivity carcass; (ii) introduce and study the cell structure of the carcass; (iii) suggest a new, cell-oriented algorithm for the incremental maintenance of the carcass. The complexity for an arbitrary sequence of U edge insertions preserving the connectivity κ of S is reduced from O(|V|· |E|+μ α(μ |V|, )) to O(s|E|+ μα(μ|V|)), where S is the number of the (κ + 1)-edge-connectivity classes in S.

Original languageEnglish
Title of host publicationProceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995
PublisherAssociation for Computing Machinery
Pages302-311
Number of pages10
ISBN (Electronic)0898713498
StatePublished - 22 Jan 1995
Externally publishedYes
Event6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995 - San Francisco, United States
Duration: 22 Jan 199524 Jan 1995

Publication series

NameProceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Conference

Conference6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995
Country/TerritoryUnited States
CitySan Francisco
Period22/01/9524/01/95

ASJC Scopus subject areas

  • Software
  • Mathematics (all)

Fingerprint

Dive into the research topics of 'Locally orientable graphs, cell structures, and a new algorithm for the incremental maintenance of connectivity carcasses'. Together they form a unique fingerprint.

Cite this