| Document Date: 2005-01-20 14:41:23
Open Document File Size: 202,97 KBShare Result on Facebook
City Kjeller / Orlando / Berlin / Diego / San Diego / New York / Grenoble / / Company Ford / ESPRIT / / Country Germany / Switzerland / Norway / / Currency USD / / / Facility library LEDA / / IndustryTerm maximum adjacency search / Linear time algorithms / recursive algorithm / improved network optimization algorithms / combinatorial and geometric computing / faster algorithm / transportation / approximation algorithm / maximum flow algorithms / combinatorial algorithm / maximum flow algorithm / deterministic minimum cut algorithm / communication networks / maximum cardinality search / graph algorithms / flow algorithm / / Organization Max-Planck-Institut / Universite´ J. Fourier / Association for Computing Machinery / / Person Kurt Mehlhorn / Dorothea Wagner / Min-Cut Algorithm / FRANK WAGNER / / Position General / / ProvinceOrState Florida / California / New York / / PublishedMedium Journal of the ACM / the Theory of Computing / Lecture Notes in Computer Science / / Technology graph algorithms / deterministic minimum cut algorithm / faster algorithm / Min-Cut Algorithm / maximum flow algorithms / randomized algorithm / following algorithm / flow algorithm / combinatorial algorithm / maximum flow algorithm / Linear time algorithms / approximation algorithm / improved network optimization algorithms / recursive algorithm / /
SocialTag |
A Simple Min-Cut Algorithm MECHTHILD STOER Televerkets Forskningsinstitutt, Kjeller, Norway