836 search results - page 21 / 168 » Orthogonal Colorings of Graphs |
WEA
2004
Springer
15 years 5 months ago
2004
Springer
86
Voted
COMBINATORICS
2007
14 years 11 months ago
2007
86
Voted
ICIP
2002
IEEE
16 years 1 months ago
2002
IEEE
In this paper, we adopt local Fourier transform as a texture representation scheme and derive eight characteristic maps for describing different aspects of co-occurrence relations...
117
click to vote
COCOON
2005
Springer
15 years 5 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 ...
114
click to vote
DSD
2003
IEEE
15 years 5 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...