scientific article; zbMATH DE number 2050721

MaRDI QIDQ4452912zbMATH OpenFDO

Authors Ahmet Balcioglu, R. Kevin Wood

Publication date 7 March 2004

Mathematics Subject Classification ID

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

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

Cited in

(11)

• Models and methods for solving the problem of network vulnerability
• The many aspects of counting lattice points in polytopes
• Theoretical and computational advances for network diversion
• A generalized framework for listing cuts and graphs
• Efficient Algorithms for the k Smallest Cuts Enumeration
• Counting Minimum (s,t)-Cuts in Weighted Planar Graphs in Polynomial Time
• scientific article; zbMATH DE number 1256718 (Why is no real title available?)
• scientific article; zbMATH DE number 2084783 (Why is no real title available?)
• scientific article; zbMATH DE number 7559431 (Why is no real title available?)
• The all-pairs vitality-maximization (VIMAX) problem
• 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 Q4452912)