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: | Chandra Chekuri, Thapanapong Rukkanchanunt, Chao Xu |
---|---|
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/44626 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Chiang Mai University |
Similar Items
-
On element-connectivity preserving graph simplification
by: Chandra Chekuri, et al.
Published: (2018) -
A note on iterated rounding for the survivable network design problem
by: Chandra Chekuri, et al.
Published: (2018) -
On connected cayley graphs of semigroups
by: T. Suksumran, et al.
Published: (2018) -
Simplification of the enhancement of visibility of leaf veins in longan using digital mammography
by: M. Ongsiriporn, et al.
Published: (2022) -
STRUCTURAL SIMPLIFICATION IN CONNECTED SPEECH OF EDUCATED SINGAPOREAN ENGLISH
by: CALVIN R. MURTY
Published: (2020)