Back to Results
First PageMeta Content
Combinatorial optimization / Graph / Tree decomposition / Max-flow min-cut theorem / Planar graphs / Tree / Topology / Dynamic programming / Connectivity / Graph theory / Mathematics / Graph operations


Document Date: 2006-01-12 14:44:14

Open Document

Share Result on Facebook

City

Morristown / /

Company

Vertex / AT&T Bell Laboratories / /

Country

Australia / /

Event

Force Majeure / /

Facility

University of Bonn / Terminal Cut / University of California / University of Sidney / /

IndustryTerm

least-weight solution / straightforward dynamic programming algorithm / minimum cut algorithm / 2terminal cut algorithm / approximation algorithm / cut algorithm / cut algorithms / overall algorithm / parallel computing systems / /

Organization

University of Sidney / University of Bonn / Department of Computer Science and Engineering / Basser Department of Computer Science / University of California at San Diego / /

Person

Murray Hill / /

ProvinceOrState

New Jersey / New South Wales / California / /

PublishedMedium

Theory of Computing / /

Region

South Wales / /

Technology

straightforward dynamic programming algorithm / 2terminal cut algorithm / overall algorithm / approximation algorithm / 2-terminal minimum cut algorithm / SNP / 2-terminal cut algorithms / planar Multiterminal Cut algorithm / 2-terminal cut algorithm / /

SocialTag