Contiguous Minimum Single-Source-Multi-Sink Cuts in Weighted Planar Graphs

DOI10.1007/978-3-642-32241-9_5zbMath1364.68302OpenAlexW48764290MaRDI QIDQ2914311

Zachary Langley, Ivona Bezáková

Publication date: 25 September 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32241-9_5

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22)

This page was built for publication: Contiguous Minimum Single-Source-Multi-Sink Cuts in Weighted Planar Graphs