1952 search results - page 70 / 391 » Complete partitions of graphs |
137
Voted
NETWORKS
2010
15 years 2 months ago
2010
Let G = (V, E, Q) be a undirected graph, where V is the set of vertices, E is the set of edges, and Q = {Q1, . . . , Qq} is a partition of V into q subsets. We refer to Q1, . . . ...
152
click to vote
STOC
2006
ACM
16 years 4 months ago
2006
ACM
Classes of graphs with bounded expansion have been introduced in [15], [12]. They generalize both proper minor closed classes and classes with bounded degree. For any class with b...
136
click to vote
SIES
2007
IEEE
15 years 10 months ago
2007
IEEE
— The research field of partitioning for electronic systems started to attract significant attention of scientists about fifteen years ago. Gaining ever more importance due to...
143
click to vote
ICNP
2005
IEEE
15 years 9 months ago
2005
IEEE
In this paper, we analyze the problem of network disconnection in the context of large-scale P2P networks and understand how both static and dynamic patterns of node failure affec...
162
click to vote
CATS
2008
15 years 5 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 ...