scientific article; zbMATH DE number 1555934

MaRDI QIDQ4525700zbMATH OpenFDO

Authors Hiroshi Nagamochi, Kazuhiro Nishimura, Toshihide Ibaraki

Publication date 24 January 2001

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Computing All Small Cuts in an Undirected Network
• Suboptimal cuts: their enumeration, weight and number (extended abstract)
• CONSTRUCTING CACTUS REPRESENTATION FOR ALL MINIMUM CUTS IN AN UNDIRECTED NETWORK
• A new approach to the minimum cut problem
• Efficient Algorithms for the k Smallest Cuts Enumeration

Cited in

(11)

• A new and improved algorithm for the 3-cut problem
• On the number of small cut in a graph
• Efficient Algorithms for the k Smallest Cuts Enumeration
• Minimum Cuts of Simple Graphs in Almost Always Linear Time
• Blocking Small Cuts in a Network, and Related Problems
• Computing All Small Cuts in an Undirected Network
• scientific article; zbMATH DE number 2050721 (Why is no real title available?)
• A faster edge splitting algorithm in multigraphs and its application to the edge-connectivity augmentation problem
• Suboptimal cuts: their enumeration, weight and number (extended abstract)
• A new contraction technique with applications to congruency-constrained cuts
• Efficient algorithms for the problems of enumerating cuts by non-decreasing weights

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4525700)