|
Volumn 2368, Issue , 2002, Pages 230-239
|
Improved algorithms for the random cluster graph model
|
Author keywords
[No Author keywords available]
|
Indexed keywords
GRAPH THEORY;
PROBABILITY;
CLUSTERING DATA;
CLUSTERING PROBLEMS;
HIGH PROBABILITY;
N-VERTEX GRAPH;
NUMBER OF CLUSTERS;
PARAMETER RANGE;
PROBABILISTIC PROCESS;
TIME COMPLEXITY;
CLUSTERING ALGORITHMS;
|
EID: 23044533396
PISSN: 03029743
EISSN: 16113349
Source Type: Book Series
DOI: 10.1007/3-540-45471-3_24 Document Type: Conference Paper |
Times cited : (10)
|
References (11)
|