| Document Date: 2012-01-21 02:17:45
Open Document File Size: 638,55 KBShare Result on Facebook
Company Ford / / / Facility Computer Science University of Illinois / University of Paris / / IndustryTerm time using whatever-first search / On computing handle / straightforward dynamic programming algorithm / basic algorithms / faster algorithm / faster algorithms / undirected planar networks / combinatorial algorithms / minimum cut algorithm / recent algorithm / published algorithm / earlier algorithms / seminal multiple-source shortest path algorithm / planar shortest-path algorithms / combinatorial minimum-cut algorithms / minimum-cut algorithm / planar networks / combinatorial algorithm / dynamic programming algorithm / whatever-first search / Approximation algorithms / / MusicGroup U2 / / Organization University of Illinois / University of Paris / National Science Foundation / Homology Covers∗ Jeff Erickson Amir Nayyeri Department / / Person Jeff Erickson Amir Nayyeri / Erickson / Colin de Verdière / / Position salesman / / ProgrammingLanguage Lazarus / / Technology basic algorithms / straightforward dynamic programming algorithm / faster algorithm / previous combinatorial algorithms / previously published algorithm / combinatorial minimum-cut algorithms / resulting algorithm / combinatorial algorithm / 1 Introduction Algorithms / planar shortest-path algorithms / shortest path algorithm / minimum cut algorithm / recent algorithm / Approximation algorithms / http / dynamic programming algorithm / minimum-cut algorithm / html / pdf / / URL http /
SocialTag |
Minimum Cuts and Shortest Non-Separating Cycles via Homology Covers∗ Jeff Erickson Amir Nayyeri