Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorChandra Chekurien_US
dc.contributor.authorThapanapong Rukkanchanunten_US
dc.contributor.authorChao Xuen_US
dc.description.abstract© Springer-Verlag Berlin Heidelberg 2015. 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.en_US
dc.subjectComputer Scienceen_US
dc.titleOn element-connectivity preserving graph simplificationen_US
dc.typeBook Seriesen_US
article.title.sourcetitleLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)en_US
article.volume9294en_US of Illinois at Urbana-Champaignen_US Mai Universityen_US
Appears in Collections:CMUL: Journal Articles

Files in This Item:
There are no files associated with this item.

Items in CMUIR are protected by copyright, with all rights reserved, unless otherwise indicated.