By Topic

Applications of a poset representation to edge connectivity and graph rigidity

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Gabow, H.N. ; Dept. of Comput. Sci., Colorado Univ., Boulder, CO, USA

A poset representation for a family of sets defined by a labeling algorithm is investigated. Poset representations are given for the family of minimum cuts of a graph, and it is shown how to compute them quickly. The representations are the starting point for algorithms that increase the edge connectivity of a graph, from λ to a given target τ=λ+δ, adding the fewest edges possible. For undirected graphs the time bound is essentially the best-known bound to test τ-edge connectivity; for directed graphs the time bound is roughly a factor δ more. Also constructed are poset representations for the family of rigid subgraphs of a graph, when graphs model structures constructed from rigid bars. The link between these problems is that they all deal with graphic matroids

Published in:

Foundations of Computer Science, 1991. Proceedings., 32nd Annual Symposium on

Date of Conference:

1-4 Oct 1991