Building Chain and Cactus Representations of All Minimum Cuts from Hao–Orlin in the Same Asymptotic Run Time-Reference-Cited by-同舟云学术

Building Chain and Cactus Representations of All Minimum Cuts from Hao–Orlin in the Same Asymptotic Run Time

Published:1999-10 Issue:1 Volume:33 Page:51-72
ISSN:0196-6774
Container-title:Journal of Algorithms
language:en
Short-container-title:Journal of Algorithms

Author:

Fleischer Lisa

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computational Mathematics,Control and Optimization

Reference28 articles.

1. Network Flows: Theory, Algorithms, and Applications;Ahuja,1993

2. D. Applegate, R. Bixby, V. Chvátal, and, W. Cook, Finding Cuts in the TSP, (a preliminary report), Technical Report, 95-05, DIMACS, 1995.

3. A. A. Benczúr, Cut Structures and Randomized Algorithms in Edge-Connectivity Problems, Ph.D. thesis, Department of Mathematics, Massachusetts Institute of Technology, June 1997.

4. A. A. Benczúr and D. R. Karger, Augmenting undirected edge connectivity in Õ(n2) time, inProceedings of the Ninth Annual ACM/SIAM Symposium on Discrete Algorithms, 1998, pp. 500–509.

5. The minimum number of edges and vertices in a graph with edge connectivity n and mn-bonds;Bixby;Networks,1975

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

1. Spanning Cactus Existence Problem on Flower Snark Graphs;Communications in Computer and Information Science;2023-11-30

2. Approximation algorithms for flexible graph connectivity;Mathematical Programming;2023-04-26

3. Spanning Cactus Existence, Optimization and Extension in Windmill Graphs;Proceedings of International Conference on Data, Electronics and Computing;2023

4. A Short Note on Spanning Cactus Problem of Petersen Graph;Learning and Analytics in Intelligent Systems;2020

5. Index;Network Flow Algorithms;2019-09-05