Maximum flow in planar digraphs Public Deposited

http://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/4x51hm73g

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • Worst-case analysis is often meaningless in practice. Some problems never reach the anticipated worst-case complexity. Other solutions get bogged down with impractical constants during implementation, despite having favorable asymptotic running times. In this thesis, we investigate these contrasts in the context of finding maximum flows in planar digraphs. We suggest analytic techniques that adapt to the problem instance, and present a structural property that concludes equivalence between shortest paths and maximum st-flow in planar graphs. The best known algorithm for maximum st-flow in directed planar graphs is an augmenting- paths algorithm with O(n) iterations. Using dynamic trees, each iteration can be implemented in O(log n) time. Long before, Itai and Shiloach showed that when s and t are on the boundary of a common face, the O(n)-iteration augmenting-paths algorithm is equivalent to Dijkstra's algorithm in the graph’s dual: the max st-planar st-flow problem can be solved with one single-source shortest-path computation. In this thesis we show that (a) when s and t are separated by p faces, the max st-flow can be found with at most 2p single-source shortest-path computations, which, using the linear-time shortest-paths algorithm for planar graphs, results in an O(np)-time algorithm, and (b) that the equivalence between augmenting-paths and Dijkstra's extends to the most general non-st-planar digraphs, using their half-infinite universal cover graph.
Resource Type
Date Available
Date Copyright
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Committee Member
Academic Affiliation
Non-Academic Affiliation
Keyword
Subject
Rights Statement
Peer Reviewed
Language
Replaces
Additional Information
  • description.provenance : Made available in DSpace on 2012-12-11T17:16:38Z (GMT). No. of bitstreams: 1 HarutyunyanAnna2012.pdf: 1192917 bytes, checksum: 969e58be25576ac09239cfb79806033e (MD5) Previous issue date: 2012-11-30
  • description.provenance : Approved for entry into archive by Julie Kurtz(julie.kurtz@oregonstate.edu) on 2012-12-10T21:02:18Z (GMT) No. of bitstreams: 1 HarutyunyanAnna2012.pdf: 1192917 bytes, checksum: 969e58be25576ac09239cfb79806033e (MD5)
  • description.provenance : Submitted by Anna Harutyunyan (harutyua@onid.orst.edu) on 2012-12-03T23:50:40Z No. of bitstreams: 1 HarutyunyanAnna2012.pdf: 1192917 bytes, checksum: 969e58be25576ac09239cfb79806033e (MD5)
  • description.provenance : Approved for entry into archive by Laura Wilson(laura.wilson@oregonstate.edu) on 2012-12-11T17:16:38Z (GMT) No. of bitstreams: 1 HarutyunyanAnna2012.pdf: 1192917 bytes, checksum: 969e58be25576ac09239cfb79806033e (MD5)

Relationships

In Administrative Set:
Last modified: 08/09/2017

Downloadable Content

Download PDF
Citations:

EndNote | Zotero | Mendeley

Items