2314 search results - page 68 / 463 » Minimal Partitions of a Graph |
114
Voted
ICNP
2005
IEEE
15 years 6 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...
100
Voted
IEEEPACT
2000
IEEE
15 years 5 months ago
2000
IEEE
Recent research suggests that DSM clusters can benefit from parallel coherence controllers. Parallel controllers require address partitioning and synchronization to avoid handlin...
JUCS
2006
15 years 1 months ago
2006
: This paper surveys some of the work that was inspired by Wagner's general technique to prove completeness in the levels of the boolean hierarchy over NP and some related res...
110
Voted
ECCV
2006
Springer
16 years 2 months ago
2006
Springer
Algorithms for discrete energy minimization play a fundamental role for low-level vision. Known techniques include graph cuts, belief propagation (BP) and recently introduced tree-...
130
Voted
CATS
2008
15 years 2 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 ...