On the number of small cut in a graph

DOI10.1016/0020-0190(96)00079-8zbMATH Open1046.68630OpenAlexW2064211276MaRDI QIDQ1847367FDOQ1847367

Authors: David P. Williamson, Monika R. Henzinger 

Publication date: 24 June 2003

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(96)00079-8

Recommendations

• scientific article; zbMATH DE number 2089977
• On the Number of Minimum Cuts in a Graph
• On the number of cut-vertices in a graph
• On bounds for the cutting number of a graph
• scientific article; zbMATH DE number 1404133
• On the cut dimension of a graph
• Graphs with the smallest number of minimum cut sets
• scientific article; zbMATH DE number 1933044
• scientific article; zbMATH DE number 749225
• The minimum size of graphs satisfying cut conditions

zbMATH Keywords

undirected graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Title not available (Why is that?)
• An Õ(n²) algorithm for minimum cuts
• Title not available (Why is that?)

Cited In (7)

• On the Number of Minimum Cuts in a Graph
• Computing All Small Cuts in an Undirected Network
• Deterministic enumeration of all minimum cut-sets and \(k\)-cut-sets in hypergraphs for fixed \(k\)
• Generalized cut trees for edge-connectivity
• On bounds for the cutting number of a graph
• Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs
• Title not available (Why is that?)

This page was built for publication: On the number of small cut in a graph

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