A linear-time algorithm for finding a sparsek-connected spanning subgraph of ak-connected graph-Reference-Cited by-同舟云学术

A linear-time algorithm for finding a sparsek-connected spanning subgraph of ak-connected graph

Published:1992-06 Issue:1-6 Volume:7 Page:583-596
ISSN:0178-4617
Container-title:Algorithmica
language:en
Short-container-title:Algorithmica

Author:

Nagamochi Hiroshi,Ibaraki Toshihide

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications,General Computer Science

Link

http://link.springer.com/content/pdf/10.1007/BF01758778.pdf

Reference9 articles.

1. S. Even and R. E. Tarjan, Network flow and testing graph connectivity,SIAM J. Comput. 4 (1975), 507–518.

2. Z. Galil, Finding the vertex connectivity of graphs,SIAM J. Comput. 9 (1980), 197–199.

3. M. R. Garey and D. S. Jhonson,Computer and Intractability, A Guide to the Theory of NP-completeness, Freeman, San Francisco, 1979.

4. D. W. Matula, Determining edge connectivity inO(nm),Proceedings of the 28th Symposium on Foundations of Computer Science (1987), pp. 249–251.

5. H. Nagamochi and T. Ibaraki, Linear time algorithms for findingk-edge-connected andk-node-connected spanning subgraphs, Technical Report #89006, Department of Applied Mathematics and Physics, Faculty of Engineering, Kyoto University (1989).

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

1. Routing problem for reducing significant outages in optical networks and its system analysis;Journal of Optical Communications and Networking;2024-08-12

2. Rethinking the implementation and application of the Benczur-Karger minimum cuts algorithm;International Journal of ADVANCED AND APPLIED SCIENCES;2024-07

3. Minimum Cut in $$O(m\log ^2 n)$$ Time;Theory of Computing Systems;2024-06-12

4. Connectivity Labeling and Routing with Multiple Vertex Failures;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

5. Efficient Routing Method for Reducing Significant Outages in Optical Networks;GLOBECOM 2023 - 2023 IEEE Global Communications Conference;2023-12-04