File(s) under permanent embargo
Efficient Algorithms for Simplifying Flow Networks
thesis
posted on 2003-12-04, 00:00 authored by Ewa MisiolekComputing maximum flow in a flow network is one of the important areas of research with many practical applications. In order to reduce the amount of work done by maximum flow algorithms, we want to detect and remove from the network all edges that have no impact on the maximum flow. In this thesis, we present several algorithms for removing such edges. In the case of undirected networks we give what we believe is the first such algorithm. For the directed case we improve on the previously known results.
History
Date Modified
2017-06-02Research Director(s)
Danny Z. ChenCommittee Members
Aaron Striegel Menelaos KaravelasDegree
- Master of Science in Computer Science and Engineering
Degree Level
- Master's Thesis
Language
- English
Alternate Identifier
etd-12042003-102851Publisher
University of Notre DameProgram Name
- Computer Science and Engineering
Usage metrics
Categories
No categories selectedKeywords
Licence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC