Skip to main navigation
Skip to search
Skip to main content
Princeton University Home
Help & FAQ
Home
Profiles
Research units
Facilities
Projects
Research output
Press/Media
Search by expertise, name or affiliation
Complexity of multiterminal cuts
E. Dahlhaus
, D. S. Johnson
, C. H. Papadimitriou
,
P. D. Seymour
, M. Yannakakis
Research output
:
Contribution to journal
›
Article
›
peer-review
537
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Complexity of multiterminal cuts'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Polynomial Time
100%
Edge
100%
Planar Graph
50%
weighted graph
50%
Min-Cut
50%
Computer Science
Polynomial Time
100%
Approximation Algorithms
50%
Planar Graph
50%
weighted graph
50%
Keyphrases
Edge-weighted Graph
50%
Max-flow Problem
50%
Optimal Cutoff
50%
Planar Problems
50%
Weight Set
50%