|
Volumn , Issue , 1997, Pages 639-648
|
Fast approximate graph partitioning algorithms
a a a a |
Author keywords
[No Author keywords available]
|
Indexed keywords
ALGORITHMS;
APPROXIMATION THEORY;
COMPUTATIONAL COMPLEXITY;
COMPUTATIONAL METHODS;
PROBLEM SOLVING;
SET THEORY;
APPROXIMATION ALGORITHMS;
GRAPH PARTITIONING PROBLEMS;
GRAPH THEORY;
|
EID: 0030733353
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper |
Times cited : (28)
|
References (21)
|