PARA
2004
Springer
14 years 4 months ago
2004
Springer
Abstract. This paper presents new efficient parallel algorithms for finding approximate solutions to graph coloring problems. We consider an existing shared memory parallel graph...
AUSAI
2004
Springer
14 years 4 months ago
2004
Springer
In this paper, we propose a new neighborhood structure based on the improvement graph for solving the Robust Graph Coloring Problem, an interesting extension of classical graph col...
FCT
2005
Springer
14 years 4 months ago
2005
Springer
Graph homomorphism, also called H-coloring, is a natural generalization of graph coloring: There is a homomorphism from a graph G to a complete graph on k vertices if and only if ...
EUROPAR
2005
Springer
14 years 4 months ago
2005
Springer
In large-scale parallel applications a graph coloring is often carried out to schedule computational tasks. In this paper, we describe a new distributedmemory algorithm for doing t...
PODC
2006
ACM
14 years 4 months ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
PPAM
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. The paper describes an application of Parallel Simulated Annealing (PSA) for solving one of the most studied NP-hard optimization problems: Graph Coloring Problem (GCP). ...
LCTRTS
2007
Springer
14 years 5 months ago
2007
Springer
Existing methods place data or code in scratchpad memory, i.e., SPM by either relying on heuristics or resorting to integer programming or mapping it to a graph coloring problem. ...
SASO
2008
IEEE
14 years 5 months ago
2008
IEEE
In this paper we study desynchronization, a closelyrelated primitive to graph coloring. A valid graph coloring is an assignment of colors to nodes such that no node’s color is t...
PERCOM
2008
ACM
14 years 5 months ago
2008
ACM
In this paper we present a protocol for sensor applications that require periodic collection of raw data reports from the entire network in a timely manner. We formulate the probl...
SAT
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. We present a new method to break symmetry in graph coloring problems. While most alternative techniques add symmetry breaking predicates in a pre-processing step, we deve...