2310 search results - page 29 / 462 » Coloring Random Graphs |
181
click to vote
COCOON
2005
Springer
15 years 11 months ago
2005
Springer
For a bounded integer , we wish to color all edges of a graph G so that any two edges within distance have different colors. Such a coloring is called a distance-edge-coloring or ...
178
click to vote
DSD
2003
IEEE
15 years 11 months ago
2003
IEEE
Heuristic algorithms for coloring the edges of large undirected single-edge graphs with (or very close to) the minimal number of colors are presented. Compared to simulated anneal...
174
click to vote
EVOW
2001
Springer
15 years 10 months ago
2001
Springer
This paper presents a new heuristic algorithm for the graph coloring problem based on a combination of genetic algorithms and simulated annealing. Our algorithm exploits a novel cr...
141
click to vote
DM
1998
15 years 5 months ago
1998
The total chromatic number zt(G) of a graph G is the least number of colors needed to color the vertices and edges of G so that no adjacent vertices or edges receive the same colo...
195
click to vote
AIPR
2004
IEEE
15 years 9 months ago
2004
IEEE
This paper describes a novel color texture-based image retrieval system for the query of an image database to find similar images to a target image. The retrieval process involves...