Concept

Graph coloring

Related publications (321)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

On a graph coloring problem arising from discrete tomography

Dominique de Werra, Bernard Ries

An extension of the basic image reconstruction problem in discrete tomography is considered: given a graph

G=(V,E)

and a family

\mathcal{P}

of chains

P_i

together with vectors

h(P_i)=(h_{i}^{1},...,h_{i}^{k})

, one wants to find a partition $V^{1},. ...

2008

A graph coloring heuristic using partial solutions and a reactive tabu scheme

Nicolas Zufferey

Most of the recent heuristics for the graph coloring problem start from an infeasible k-coloring (adjacent vertices may have the same color) and try to make the solution feasible through a sequence of color exchanges. In contrast, our approach (called FOO- ...

2008

Some coloring and walking problems in graphs

Benjamin Leroy-Beaulieu

Graph theory is an important topic in discrete mathematics. It is particularly interesting because it has a wide range of applications. Among the main problems in graph theory, we shall mention the following ones: graph coloring and the Hamiltonian circuit ...

EPFL2008

Automated Delineation of Dendritic Networks in Noisy Image Stacks

Pascal Fua, François Fleuret, Germán González Serrano

We present a novel approach to 3D delineation of dendritic networks in noisy image stacks. We achieve a level of automation beyond that of state-of-the-art systems, which model dendrites as continuous tubular structures and postulate simple appearance mode ...

Springer-Verlag2008

Variable space search for graph coloring

Nicolas Zufferey, Matthieu Plumettaz

Let G = (V, E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign a color (a number chosen in {1, ..., k}) to each vertex of G so that no edge has both endpoints with the same color. We propose a new local search methodology, ...

2008

On two coloring problems in mixed graphs

Dominique de Werra, Bernard Ries

We are interested in coloring the vertices of a mixed graph, i.e., a graph containing edges and arcs. We consider two different coloring problems: in the first one we want adjacent vertices to have different colors and the tail of an arc to get a color str ...

2008

Complexity of mixed graph coloring

Bernard Ries

In this note we consider two coloring problems in mixed graphs, i.e., graphs containing edges and arcs. We show that they are both

\mathcal{NP}

-complete in cubic planar bipartite graphs. This answers an open question from \cite{Ries2}. ...

2008

Polar cographs

Dominique de Werra, Tinaz Ekim

Polar graphs are a natural extension of some classes of graphs like bipartite graphs, split graphs and complements of bipartite graphs. A graph is (s, k)-polar if there exists a partition A, B of its vertex set such that A induces a complete s-partite grap ...

Elsevier2008

Dynamic Testing of Flow Graph Based Parallel Applications

Roger Hersch

In message-passing parallel applications, messages are not delivered in a strict order. The number of messages, their content and their destination may depend on the ordering of their delivery. Nevertheless, for most applications, the computation results s ...

ACM2008

Wavelets on Graphs via Spectral Graph Theory

Pierre Vandergheynst, Rémi Gribonval

We propose a novel method for constructing wavelet transforms of functions defined on the vertices of an arbitrary finite graph. We define a notion of scaling using the graph analogue of the Fourier domain, namely the space of eigenfunctions forming the sp ...

2008