1952 search results - page 146 / 391 » Complete partitions of graphs |
122
click to vote
SIAMDM
2008
15 years 4 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...
168
click to vote
PAMI
2007
15 years 4 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....
106
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 ...
132
click to vote
DAC
2008
ACM
16 years 5 months ago
2008
ACM
Many computational tools have recently begun to benefit from the use of the symmetry inherent in the tasks they solve, and use general-purpose graph symmetry tools to uncover this...
145
Voted
ISPD
2010
ACM
15 years 11 months ago
2010
ACM
Obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) construction is becoming one of the most sought after problems in modern design flow. In this paper we present FOARS, ...