A Survey on Min-cut On Planar Graphs

Please enable javascript in your browser.

Oraee, Simin | 2017

742 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 50294 (02)
University: Sharif University of Technology
Department: Mathematical Sciences
Advisor(s): Foroughmand Arabi, Mohammad Hadi
Abstract:
In minimum cut problem we aim at finding a set of edges with minimum overall cost possible, such that removing them would separate two specific vertices, source and sink. This problem has been studied thoroughly, however the available algorithms were not proven to be time-wise optimal. Nowadays, planar graphs have attracted more attention because of their applications in cities and countries map. Moreover,their characteristics and properties, make some problems easier to solve in planar case. In this thesis, we will have a survey on algorithms for minimum cut on planar graphs. Our motivation to choose these algorithms is the balance between how easily they could be implemented and how fast they can find the answer to the problem. In addition, the ideas behind them come in handy in many other algorithms
Keywords:
Graphs ; Algorithms ; Planar Graph ; Minimum Cut ; Shortest Path ; Maximum Flow