1952 search results - page 16 / 391 » Complete partitions of graphs |
SIAMDM
2008
13 years 7 months ago
2008
Given a graph G = (V, E) with node weights v N {0}, v V , and some number F N{0}, the convex hull of the incidence vectors of all cuts (S), S V with (S) F and (V \ S) F is ...
COMBINATORICA
2010
13 years 2 months ago
2010
We prove that every rayless graph has an unfriendly partition.
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
We propose a new crossover that generalizes cycle crossover to permutations with repetitions and naturally suits partition problems. We tested it on graph partitioning problems ob...
EOR
2010
13 years 7 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...
ISM
2006
IEEE
14 years 1 months ago
2006
IEEE
Given a large social or computer network, how can we visualize it, find patterns, outliers, communities? Although several graph visualization tools exist, they cannot handle larg...