|
Volumn 2, Issue , 1997, Pages 1009-1012
|
Faster algorithms for finding a minimum K-way cut in a weighted graph
a a a |
Author keywords
[No Author keywords available]
|
Indexed keywords
ALGORITHMS;
COMPUTATIONAL COMPLEXITY;
POLYNOMIALS;
RECURSIVE FUNCTIONS;
UNDIRECTED WEIGHTED GRAPHS;
GRAPH THEORY;
|
EID: 0030686288
PISSN: 02714310
EISSN: None
Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper |
Times cited : (8)
|
References (10)
|