2314 search results - page 165 / 463 » Minimal Partitions of a Graph |
112
click to vote
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
Various applications of spectral techniques for enhancing graph bisection in genetic algorithms are investigated. Several enhancements to a genetic algorithm for graph bisection a...
117
click to vote
SIAMDM
2008
15 years 3 months ago
2008
The first-fit chromatic number of a graph is the number of colors needed in the worst case of a greedy coloring. It is also called the Grundy number, which is defined to be the max...
163
click to vote
PAMI
2007
15 years 3 months ago
2007
—A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods....
132
click to vote
DAM
2010
15 years 4 months ago
2010
We study P6-free graphs, i.e., graphs that do not contain an induced path on six vertices. Our main result is a new characterization of this graph class: a graph G is P6-free if an...
101
click to vote
ICPR
2008
IEEE
16 years 5 months ago
2008
IEEE
In this paper we propose a novel method for generic object localization. The method is based on modeling the object as a graph at two levels: a local substructural representation ...