1221 search results - page 30 / 245 » Balanced graph partitioning |
95
Voted
JGT
2010
15 years 1 months ago
2010
113
Voted
ICML
2010
IEEE
15 years 3 months ago
2010
IEEE
We describe an algorithm for clustering using a similarity graph. The algorithm (a) runs in O(n log3 n + m log n) time on graphs with n vertices and m edges, and (b) with high pro...
103
Voted
CORR
2010
Springer
15 years 5 days ago
2010
Springer
Given a bidirected ring with capacities and a demand graph, we present an approximate solution to the problem of nding the minimum such that there exists a feasible routing of the...
151
Voted
OL
2010
14 years 9 months ago
2010
This article studies a degree-bounded generalization of independent sets called co-k-plexes. Constant factor approximation algorithms are developed for the maximum co-k-plex probl...