Complexity of multiterminal cuts

SIAM Journal on Computing

Volumn 23, Issue 4, 1994, Pages 864-894

  Dahlhaus, E ^a   Johnson, D S ^a   Papadimitriou, C H ^a   Seymour, P D ^a   Yannakakis, M ^a  

^a UNIVERSITY OF SYDNEY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CONSTRAINT THEORY; GRAPH THEORY; OPTIMIZATION; POLYNOMIALS; SET THEORY; THEOREM PROVING;

MULTITERMINAL CUT; NETWORK FLOW; PARTITIONING; PLANAR GRAPH; POLYNOMIAL TIME;

COMPUTATIONAL COMPLEXITY;

EID: 0028484228     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539792225297     Document Type: Article

References (24)