Nominal color coding is the aesthetic and functional use of color to convey qualitative information in graphical environments. The specification of high-contrast color sets is a fundamental step in this process. We formulate the color-coding problem here as a combinatorial optimization problem on graphs and present an algorithm that performs well and does not require that the function used to code the similarity between colors be a distance function
A proper colouring of a graph is a function that assigns a colour to each vertex with the restrictio...
We propose an approach, called the Equilibrium Distribution Model (EDM), for automatically selecting...
Color features are among the most important features used in image database retrieval, especially in...
We have developed a new algorithm and software for graph coloring by systematically combining severa...
The ability to compute color constant descriptors of objects in view irrespective of the light illum...
This chapter presents an introduction to graph colouring algorithms. The focus is on vertex-colourin...
This paper provides an insight into graph coloring application of the contemporary heuristic methods...
Encoding data using color is a key technique employed by almost all visualizations. A set of colors ...
We propose a method for identifying a set of colours for displaying 2D and 3D categorical images whe...
Subjects sought a unique target shape in a display of abstractor shapes under three colour coding co...
This unique textbook treats graph colouring as an algorithmic problem, with a strong emphasis on pra...
We propose a method for identifying a set of colours for displaying 2-D and 3-D categorical images w...
A coloring of a graph is an assignment of colors to its vertices so that no two adjacent vertices ar...
Graph drawing research traditionally focuses on producing geometric embeddings of graphs satisfyin...
B-coloring is a problem in graph theory at the basis of several real applications and also used to i...
A proper colouring of a graph is a function that assigns a colour to each vertex with the restrictio...
We propose an approach, called the Equilibrium Distribution Model (EDM), for automatically selecting...
Color features are among the most important features used in image database retrieval, especially in...
We have developed a new algorithm and software for graph coloring by systematically combining severa...
The ability to compute color constant descriptors of objects in view irrespective of the light illum...
This chapter presents an introduction to graph colouring algorithms. The focus is on vertex-colourin...
This paper provides an insight into graph coloring application of the contemporary heuristic methods...
Encoding data using color is a key technique employed by almost all visualizations. A set of colors ...
We propose a method for identifying a set of colours for displaying 2D and 3D categorical images whe...
Subjects sought a unique target shape in a display of abstractor shapes under three colour coding co...
This unique textbook treats graph colouring as an algorithmic problem, with a strong emphasis on pra...
We propose a method for identifying a set of colours for displaying 2-D and 3-D categorical images w...
A coloring of a graph is an assignment of colors to its vertices so that no two adjacent vertices ar...
Graph drawing research traditionally focuses on producing geometric embeddings of graphs satisfyin...
B-coloring is a problem in graph theory at the basis of several real applications and also used to i...
A proper colouring of a graph is a function that assigns a colour to each vertex with the restrictio...
We propose an approach, called the Equilibrium Distribution Model (EDM), for automatically selecting...
Color features are among the most important features used in image database retrieval, especially in...