On element-connectivity preserving graph simplification
© 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...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Book Series |
| Published: |
2018
|
| Subjects: | |
| Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84945535090&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/54399 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Chiang Mai University |
| id |
th-cmuir.6653943832-54399 |
|---|---|
| record_format |
dspace |
| spelling |
th-cmuir.6653943832-543992018-09-04T10:19:49Z On element-connectivity preserving graph simplification Chandra Chekuri Thapanapong Rukkanchanunt Chao Xu Computer Science Mathematics © 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. 2018-09-04T10:12:53Z 2018-09-04T10:12:53Z 2015-01-01 Book Series 16113349 03029743 2-s2.0-84945535090 10.1007/978-3-662-48350-3_27 https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84945535090&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/54399 |
| institution |
Chiang Mai University |
| building |
Chiang Mai University Library |
| country |
Thailand |
| collection |
CMU Intellectual Repository |
| topic |
Computer Science Mathematics |
| spellingShingle |
Computer Science Mathematics Chandra Chekuri Thapanapong Rukkanchanunt Chao Xu On element-connectivity preserving graph simplification |
| description |
© 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. |
| format |
Book Series |
| author |
Chandra Chekuri Thapanapong Rukkanchanunt Chao Xu |
| author_facet |
Chandra Chekuri Thapanapong Rukkanchanunt Chao Xu |
| author_sort |
Chandra Chekuri |
| title |
On element-connectivity preserving graph simplification |
| title_short |
On element-connectivity preserving graph simplification |
| title_full |
On element-connectivity preserving graph simplification |
| title_fullStr |
On element-connectivity preserving graph simplification |
| title_full_unstemmed |
On element-connectivity preserving graph simplification |
| title_sort |
on element-connectivity preserving graph simplification |
| publishDate |
2018 |
| url |
https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84945535090&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/54399 |
| _version_ |
1681424313433980928 |