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 |
---|---|
格式: | Book Series |
出版: |
2018
|
主題: | |
在線閱讀: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84945535090&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/54399 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
相似書籍
-
On element-connectivity preserving graph simplification
由: Chandra Chekuri, et al.
出版: (2018) -
A note on iterated rounding for the survivable network design problem
由: Chandra Chekuri, et al.
出版: (2018) -
Constrained mesh simplification
由: Xu, Zhenyu.
出版: (2011) -
AdaMotif: graph simplification via adaptive motif design
由: Zhou, Hong, et al.
出版: (2024) -
Work-efficient parallel union-find with applications to incremental graph connectivity
由: Natcha Simsiri, et al.
出版: (2018)