2310 search results - page 29 / 462 » Coloring Random Graphs |
COCOON
2005
Springer
14 years 1 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 ...
DSD
2003
IEEE
14 years 1 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...
EVOW
2001
Springer
14 years 6 days 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...
DM
1998
13 years 7 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...
AIPR
2004
IEEE
13 years 11 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...