1951 search results - page 134 / 391 » An algorithm for improving graph partitions |
189
click to vote
CIAC
2010
Springer
15 years 9 months ago
2010
Springer
We investigate the relationship between two kinds of vertex colorings of graphs: uniquemaximum colorings and conflict-free colorings. In a unique-maximum coloring, the colors are ...
269
click to vote
CVPR
2011
IEEE
15 years 1 months ago
2011
IEEE
We propose a new family of non-submodular global energy functions that still use submodularity internally to couple edges in a graph cut. We show it is possible to develop an efï¬...
138
click to vote
LATIN
1998
Springer
15 years 10 months ago
1998
Springer
The problem of approximate pattern matching on hypertext is de ned and solved by Amir et al. in O(m(nlogm + e)) time, where m is the length of the pattern, n is the total text size...
104
click to vote
GECCO
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. As a preprocessing for genetic algorithms, static reordering helps genetic algorithms effectively create and preserve high-quality schemata, and consequently improves th...
176
click to vote
EVOW
2004
Springer
15 years 11 months ago
2004
Springer
This paper introduces a new social metaheuristic for the Max-Cut problem applied to a weighted undirected graph. This problem consists in finding a partition of the nodes into two ...