10 search results - page 1 / 2 » Satisfactory graph partition, variants, and generalizations |
EOR
2010
13 years 4 months ago
2010
The Satisfactory Partition problem asks for 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 neighbor...
DAM
2006
13 years 4 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...
COCOON
2005
Springer
13 years 10 months ago
2005
Springer
The Satisfactory Partition problem consists of 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 neighb...
ICCAD
1994
IEEE
13 years 8 months ago
1994
IEEE
We present a general framework for the construction of vertex orderings for netlist clustering. Our WINDOW algorithm constructs an ordering by iteratively adding the vertex with h...
COMBINATORICA
2010
12 years 11 months ago
2010
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...