4009 search results - page 48 / 802 » Clustering on Complex Graphs |
120
Voted
TCS
2008
15 years 3 months ago
2008
We consider computational complexity questions related to parallel knock-out schemes for graphs. In such schemes, in each round, each remaining vertex of a given graph eliminates ...
133
Voted
ICDM
2009
IEEE
15 years 1 months ago
2009
IEEE
Clustering methods usually require to know the best number of clusters, or another parameter, e.g. a threshold, which is not ever easy to provide. This paper proposes a new graph-b...
124
Voted
SOFSEM
2009
Springer
16 years 15 days ago
2009
Springer
During the last years, speed-up techniques for DIJKSTRA’s algorithm have been developed that make the computation of shortest paths a matter of microseconds even on huge road net...
137
Voted
COCO
2004
Springer
15 years 9 months ago
2004
Springer
In decision tree models, considerable attention has been paid on the effect of symmetry on computational complexity. That is, for a permutation group Γ, how low can the complexit...
143
Voted
COCOA
2010
Springer
14 years 10 months ago
2010
Springer
An intense activity is nowadays devoted to the definition of models capturing the properties of complex networks. Among the most promising approaches, it has been proposed to model...