View Document Preview and Link Document Date: 2009-08-14 15:23:44 Open Document File Size: 551,75 KB Share Result on Facebook
City Aarhus / Santa Monica / / Company Cambridge University Press / Johns Hopkins University Press / Theoretical Aspects Comp / The RAND Corporation / Ford / McCormick / / Country United States / Denmark / / Currency USD / / / Facility Prentice Hall / Brown University / Computer Science University of Illinois / Hebrew University / University of Paris / / IndustryTerm recent and more general algorithms / prior max-flow algorithm / subquadratic algorithms / undirected planar networks / recent multiple-source shortest path algorithms / recent algorithm / combinatorial maximum-flow algorithms / minimum-cut algorithms / planar maximum-flow algorithms / real-world networks / planar undirected network / polynomial-time algorithm / planar networks / parallel solution / transportation networks / planar directed flow algorithm / approximation algorithms / shortest-path algorithms / directed planar networks / network simplex algorithm / linear time algorithms / On computing handle / then computing / pushrelabel algorithm / near-linear-time algorithms / Linear time algorithm / planar-graph algorithms / sparse linear systems / greedy algorithm / homology / minimum-cut algorithm / flow algorithms / planar shortest-path algorithm / sequential and parallel algorithms / computing / planar minimum-cut algorithm / shortest-path algorithm / / Organization Cambridge University / University of Illinois / Urbana-Champaign / National Science Foundation / Brown University / Johns Hopkins University / Minimum Cuts and Shortest Homologous Cycles∗ Erin W. Chambers Jeff Erickson Department of Computer Science / University of Paris / Hebrew University / J. Assoc. / Saint Louis University / / Person D. J. Rose / R. J. Lipton / Nat / Colin de Verdière / Aparna Sundar / Amir Nayyeri / Chandra Chekuri / Erin W. Chambers Jeff Erickson / D. D. Sleator / R. E. Tarjan / / Position output representative / salesman / representative / Graph algorithms General / / ProgrammingLanguage Lazarus / / ProvinceOrState Illinois / California / / Technology network simplex algorithm / planar shortest-path algorithm / planar directed flow algorithm / planar-graph algorithms / time algorithm / sequential and parallel algorithms / known minimum-cut algorithms / shortest path algorithms / pushrelabel algorithm / minimum-cut algorithm / shortest-path algorithm / Faster shortest-path algorithms / html / J. Graph Algorithms / planar minimum-cut algorithms / P. An algorithm / flow algorithms / pdf / Two linear time algorithms / planar minimum-cut algorithm / Graph algorithms / planar maximum-flow algorithms / O. The algorithm / known combinatorial maximum-flow algorithms / polynomial-time algorithm / near-linear-time algorithms / greedy algorithm / recent algorithm / http / approximation algorithms / Linear time algorithm / time algorithms / prior max-flow algorithm / simulation / H. Our algorithm / G. Our algorithm / / URL http / SocialTag 
Minimum Cuts and Shortest Homologous Cycles∗ Erin W. Chambers Jeff Erickson Department of Computer Science and Mathematics