1221 search results - page 69 / 245 » Balanced graph partitioning |
CATS
2008
13 years 10 months ago
2008
The problem of deciding whether the edge-set of a given graph can be partitioned into at most k cliques is well known to be NP-complete. In this paper we investigate this problem ...
DAM
2006
13 years 9 months ago
2006
The Satisfactory Partition problem consists in deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neigh...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Modularity was introduced as a measure of goodness for the community structure induced by a partition of the set of vertices in a graph. Then, it also became an objective...
IFL
1997
Springer
14 years 1 months ago
1997
Springer
Functional programs, by nature, operate on functional, or persistent, data structures. Therefore, persistent graphs are a prerequisite to express functional graph algorithms. In th...
DATE
1999
IEEE
14 years 1 months ago
1999
IEEE
We present a novel algorithm based on dynamic programming with binning to find, subject to a given deadline, the minimum-cost coarse-grain hardware/software partitioning and mappin...