Contiguous minimum single-source-multi-sink cuts in weighted planar graphs

DOI10.1007/978-3-642-32241-9_5MaRDI QIDQ2914311zbMATH OpenOpenAlexFDO

Authors Ivona Bezáková, Zachary Langley

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

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

Recommendations

• Counting and sampling minimum (s,t)-cuts in weighted planar graphs in polynomial time
• Minimum planar multi-sink cuts with connectivity priors
• Counting Minimum (s,t)-Cuts in Weighted Planar Graphs in Polynomial Time
• Minimum s-t cut in undirected planar graphs when the source and the sink are close
• scientific article; zbMATH DE number 6469225

Cited in

(4)

• Minimum planar multi-sink cuts with connectivity priors
• Counting Minimum (s,t)-Cuts in Weighted Planar Graphs in Polynomial Time
• A Polynomial-Time Algorithm for Planar Multicuts with Few Source-Sink Pairs
• Counting and sampling minimum (s,t)-cuts in weighted planar graphs in polynomial time

This page was built for publication: Contiguous minimum single-source-multi-sink cuts in weighted planar graphs

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