Counting Minimum (s,t)-Cuts in Weighted Planar Graphs in Polynomial Time
From MaRDI portal
Publication:3586078
DOI10.1007/978-3-642-15155-2_13zbMath1287.05144OpenAlexW1481341021MaRDI QIDQ3586078
Ivona Bezáková, Adam J. Friedlander
Publication date: 3 September 2010
Published in: Mathematical Foundations of Computer Science 2010 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-15155-2_13
Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Machine vision and scene understanding (68T45)