762 search results - page 78 / 153 » Strategic Coloring of a Graph |
129
click to vote
ICIAR
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. This paper presents an approach based on graph cuts initially used for motion segmentation that is being applied to the nonrigid registration problem. The main contributi...
117
click to vote
GECCO
2006
Springer
15 years 8 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...
152
click to vote
CPAIOR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. This paper proposes to use local search inside filtering algorithms of combinatorial structures for which achieving a desired level of consistency is too computationally ...
119
click to vote
COMBINATORICS
1999
15 years 4 months ago
1999
It is proven that for every fixed h, a and b, a graph with n vertices and minimum degree at least h-1 h n, which contains no copy of Kb (the complete graph with b vertices), conta...
123
click to vote
ICCAD
2001
IEEE
16 years 1 months ago
2001
IEEE
In this work, we present an algorithm for simultaneous template generation and matching. The algorithm profiles the graph and iteratively contracts edges to create the templates. ...