On Element-Connectivity Preserving Graph Simplification-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

On Element-Connectivity Preserving Graph Simplification

Published:2015 Issue: Volume: Page:313-324
ISSN:0302-9743
Container-title:Algorithms - ESA 2015
language:
Short-container-title:

Author:

Chekuri Chandra,Rukkanchanunt Thapanapong,Xu Chao

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-662-48350-3_27

Reference26 articles.

1. Aazami, A., Cheriyan, J., Jampani, K.: Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs. Algorithmica 63(1–2), 425–456 (2012)

2. Benczúr, A.A.: Counterexamples for directed and node capacitated cut-trees. SIAM Journal on Computing 24(3), 505–510 (1995)

3. Chekuri, C., Korula, N.: A graph reduction step preserving element-connectivity and packing steiner trees and forests. SIAM Journal on Discrete Mathematics 28(2), 577–597 (2014)

4. Cheriyan, J., Salavatipour, M.: Packing Element-Disjoint Steiner Trees. ACM Transactions on Algorithms 3(4) (2007)

5. Cheriyan, J., Vempala, S., Vetta, A.: Network Design via Iterative Rounding of Setpair Relaxations. Combinatorica 26(3), 255–275 (2006)

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. D-Lite: Navigation-Oriented Compression of 3D Scene Graphs for Multi-Robot Collaboration;IEEE Robotics and Automation Letters;2023-11

2. Tight Conditional Lower Bounds for Vertex Connectivity Problems;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

3. Optimal vertex connectivity oracles;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09

4. The κk-connectivity of line graphs;Discrete Applied Mathematics;2020-10

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3