Matthieu Plumettaz

This person is no longer with EPFL

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

About
Privacy
Disclaimer

Graph Chatbot

About this result

Related publications (2)

Please note that this is not a complete list of this person’s publications. It includes only semantically relevant works. For a full list, please refer to Infoscience.

Variable space search for graph coloring (vol 156, pg 2551, 2008)

Nicolas Zufferey, Matthieu Plumettaz

2009

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

Related publications (2)

Please note that this is not a complete list of this person’s publications. It includes only semantically relevant works. For a full list, please refer to Infoscience.

Variable space search for graph coloring (vol 156, pg 2551, 2008)

Nicolas Zufferey, Matthieu Plumettaz

2009

Variable space search for graph coloring

Nicolas Zufferey, Matthieu Plumettaz

2008