Minimum s-t cut in undirected planar graphs when the source and the sink are close

Kaplan, Haim; Nussbaum, Yahav

doi:10.4230/LIPIcs.STACS.2011.117

Document

Minimum s-t cut in undirected planar graphs when the source and the sink are close

Authors Haim Kaplan, Yahav Nussbaum

Part of: Volume: 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)
Part of: Series: Leibniz International Proceedings in Informatics (LIPIcs)
Part of: Conference: Symposium on Theoretical Aspects of Computer Science (STACS)
License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
Publication Date: 2011-03-11

PDF

File

PDF

LIPIcs.STACS.2011.117.pdf

Filesize: 0.66 MB
12 pages

Document Identifiers

DOI: 10.4230/LIPIcs.STACS.2011.117
URN: urn:nbn:de:0030-drops-30049

Subject Classification

Keywords

planar graph
minimum cut
shortest path
cut cycle

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

PDF Downloads

0

Metadata Views

Abstract

Consider the minimum s-t cut problem in an embedded undirected planar graph. Let p be the minimum number of faces that a curve from s to $t$ passes through. If p=1, that is, the vertices s and t are on the boundary of the same face, then the minimum cut can be found in O(n)time. For general planar graphs this cut can be found in O(n log n) time. We unify these results and give an O(n log p) time algorithm. We use cut-cycles to obtain the value of the minimum cut, and study the structure of these cycles to get an efficient algorithm.

Cite As Get BibTex

Haim Kaplan and Yahav Nussbaum. Minimum s-t cut in undirected planar graphs when the source and the sink are close. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 117-128, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011) https://doi.org/10.4230/LIPIcs.STACS.2011.117

Author Details

Haim Kaplan

Yahav Nussbaum

Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail