@inproceedings{71667b0ea4ec4698a323eac244d09014,

title = "Minimum S - T cut in undirected planar graphs when the source and the sink are close",

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.",

keywords = "Cut cycle, Minimum cut, Planar graph, Shortest path",

author = "Haim Kaplan and Yahav Nussbaum",

year = "2011",

doi = "10.4230/LIPIcs.STACS.2011.117",

language = "אנגלית",

isbn = "9783939897255",

series = "Leibniz International Proceedings in Informatics, LIPIcs",

pages = "117--128",

booktitle = "28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011",

note = "28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011 ; Conference date: 10-03-2011 Through 12-03-2011",

}