scientific article; zbMATH DE number 2050721

zbMATH Open1099.90078MaRDI QIDQ4452912FDOQ4452912

R. Kevin Wood, Ahmet Balcioglu

Publication date: 7 March 2004

Title of this publication is not available (Why is that?)

Recommendations

• Efficient Algorithms for the k Smallest Cuts Enumeration
• Suboptimal cuts: their enumeration, weight and number (extended abstract)
• Computing All Small Cuts in an Undirected Network
• Efficient algorithms for the problems of enumerating cuts by non-decreasing weights
• scientific article; zbMATH DE number 1555934

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30)

Cited In (9)

• Models and methods for solving the problem of network vulnerability
• The all-pairs vitality-maximization (VIMAX) problem
• The many aspects of counting lattice points in polytopes
• Theoretical and computational advances for network diversion
• Efficient Algorithms for the k Smallest Cuts Enumeration
• Title not available (Why is that?)
• Title not available (Why is that?)
• Counting Minimum (s,t)-Cuts in Weighted Planar Graphs in Polynomial Time
• Title not available (Why is that?)

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 Q4452912)