Back to Results
First PageMeta Content
Theoretical computer science / Flow network / Ford–Fulkerson algorithm / Maximum flow problem / Push-relabel maximum flow algorithm / Portable character set / Network flow / Mathematics / Applied mathematics


Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems JACK EDMONDS
Add to Reading List

Document Date: 2004-04-01 07:05:06


Open Document

File Size: 791,61 KB

Share Result on Facebook

City

Calgary / Waterloo / /

Company

Machinery Inc. / E D M O N D S A / Ford / Fulkerson / /

Country

Canada / /

Facility

Network Flow Problems JACK EDMONDS University of Waterloo / University of Waterloo / K A R P University of California / College of Engineering / /

IndustryTerm

n-node network / earlier algorithms / shortest-path algorithm / e - c / /

Organization

University of California / Berkeley / University of Waterloo / Operations Research Center / College of Engineering / Association for Computing Machinery / /

Person

M. KARP THEORE / /

Position

Prime Minister / /

ProgrammingLanguage

PHP / /

ProvinceOrState

California / Ontario / /

Technology

t- 1 / following algorithm / PHP / shortest-path algorithm / be determined using the following algorithm / /

SocialTag