Algorithms for connectivity problems in undirected graphs : maximum flow and minimun [kappa]-way cut.
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2002. === In title on t.p., "[kappa]" apears as lower-case Greek letter. === Includes bibliographical references (p. [69]-72). === We consider two connectivity problems on undirect...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | English |
| Published: |
Massachusetts Institute of Technology
2005
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/29234 |