Maximum flow in planar digraphs
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 i...
| Main Author: | |
|---|---|
| Other Authors: | |
| Language: | en_US |
| Published: |
2012
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1957/35602 |