On the Number of Minimum Cuts in a Graph
From MaRDI portal
Publication:4652629
DOI10.1137/S0895480103427138zbMath1071.05046MaRDI QIDQ4652629
L. Sunil Chandran, L. Shankar Ram
Publication date: 28 February 2005
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Related Items
Efficient pattern matching on big uncertain graphs ⋮ Unnamed Item ⋮ An improved algorithm for the longest induced path problem on \(k\)-chordal graphs
This page was built for publication: On the Number of Minimum Cuts in a Graph