Abstract
The notion of element-connectivity has found several important applications in network design and routing problems. We focus on a reduction step that preserves the element-connectivity [18,4,3], which when applied repeatedly allows one to reduce the original graph to a simpler one. This pre-processing step is a crucial ingredient in several applications. In this paper we revisit this reduction step and provide a new proof via the use of setpairs. Our main contribution is algorithmic results for several basic problems on element-connectivity including the problem of achieving the aforementioned graph simplification.We utilize the underlying submodularity properties of element-connectivity to derive faster algorithms.
Author supplied keywords
Cite
CITATION STYLE
Chekuri, C., Rukkanchanunt, T., & Xu, C. (2015). On element-connectivity preserving graph simplification. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9294, pp. 313–324). Springer Verlag. https://doi.org/10.1007/978-3-662-48350-3_27
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
