Computing all small cuts in undirected networks-Reference-Cited by-同舟云学术

Computing all small cuts in undirected networks

Published:1994 Issue: Volume: Page:190-198
ISSN:0302-9743
Container-title:Algorithms and Computation
language:
Short-container-title:

Author:

Nagamochi Hiroshi,Nishimura Kazuhiro,Ibaraki Toshihide

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-58325-4_181.pdf

Reference12 articles.

1. R. Bixby, The minimum number of edges and vertices in a graph with edge-connectivity n and m n-bonds, Networks, Vol.5, 1975, pp. 235–298.

2. C.J. Colbourn, The combinatorics of network reliability, Oxford University Press, New York Oxford, 1987.

3. E. Dinits, A.V. Karzanov and M.V. Lomonosov, On the structure of a family of minimal weighed cuts in a graph, Studies in Discrete Optimization (in Russian), A. A. Fridman (Ed.), Nauka, Moscow, 1976, pp. 290–306.

4. A. Frank, Augmenting graphs to meet edge-connectivity requirements, SIAM J. Discrete Mathematics, Vol.5, 1992, pp. 25–53.

5. A. Frank, On a theorem of Mader, Discrete Mathematics, Vol.101, 1992, pp. 49–57.

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

1. A new contraction technique with applications to congruency-constrained cuts;Mathematical Programming;2020-04-15

2. Minimum Cuts of Simple Graphs in Almost Always Linear Time;WALCOM: Algorithms and Computation;2009

3. A Simple and Fast Min-cut Algorithm;Fundamentals of Computation Theory;2005

4. Planarity of the 2-Level Cactus Model;Graph-Theoretic Concepts in Computer Science;2001

5. A new and improved algorithm for the 3-cut problem;Operations Research Letters;1997-01