On the number of small cuts in a graph

Information Processing Letters

Volumn 59, Issue 1, 1996, Pages 41-44

  Henzinger, Monika ^a   Williamson, David P ^b  

^a HEWLETT PACKARD COMPANY   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Algorithms; Cuts in a graph

Indexed keywords

EID: 0040203288     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(96)00079-8     Document Type: Article

References (3)

1. D.R. Karger, Minimum cuts in near-linear time, in: Proc. 28th Ann. Symp. on the Theory of Computing (1996).
2. D.R. Karger and C. Stein, A new approach to the minimum cut problem, in: Proc. 25th Ann. Symp. on the Theory of Computing (1993) 757-765.
3. H. Nagamochi, K. Nishimura and T. Ibaraki, Computing all small cuts in an undirected network, in: D.-Z. Du and X.-S. Zhang, eds., Proc. 5th Internat. Symposium on Algorithms and Computation Lecture Notes in Computer Science 834 (Springer, Berlin, 1994) 190-198.