Sciweavers

836 search results - page 53 / 168
» Orthogonal Colorings of Graphs
Sort
View
ANOR
2002
110views more  ANOR 2002»
15 years 1 months ago
Tabu Search with Simple Ejection Chains for Coloring Graphs
We present a Tabu Search (TS) method that employs a simple version of ejection chains for coloring graphs. The procedure is tested on a set of benchmark problems. Empirical result...
José Luis González Velarde, Manuel L...
JUCS
2006
94views more  JUCS 2006»
15 years 1 months ago
Completeness in the Boolean Hierarchy: Exact-Four-Colorability, Minimal Graph Uncolorability, and Exact Domatic Number Problems
: This paper surveys some of the work that was inspired by Wagner's general technique to prove completeness in the levels of the boolean hierarchy over NP and some related res...
Tobias Riege, Jörg Rothe
COMGEO
2004
ACM
15 years 1 months ago
The weighted farthest color Voronoi diagram on trees and graphs
Let n point sites be situated on the vertices or edges of a geometric graph G over e edges. Each site can be assigned a multiplicative weight and a color. We discuss the complexit...
Ferran Hurtado, Rolf Klein, Elmar Langetepe, Vera ...
JOT
2010
216views more  JOT 2010»
15 years 10 days ago
A UML and Colored Petri Nets Integrated Modeling and Analysis Approach using Graph Transformation
Nowadays, UML is considered to be the standardized language for object-oriented modeling and analysis. However, UML cannot be used for automatic analyses and simulation. In this pa...
Elhillali Kerkouche, Allaoua Chaoui, El Bay Bouren...
IH
1999
Springer
15 years 6 months ago
Hiding Signatures in Graph Coloring Solutions
Abstract. One way to protect a digital product is to embed an author's signature into the object in the form of minute errors. However, this technique cannot be directly appli...
Gang Qu, Miodrag Potkonjak