Concept
Théorème des quatre couleurs
Publications associées (32)
Variations of coloring problems related to scheduling and discrete tomography
The graph coloring problem is one of the most famous problems in graph theory and has a large range of applications. It consists in coloring the vertices of an undirected graph with a given number of colors such that two adjacent vertices get different col ...
EPFL2007Joint acoustic-video fingerprinting of vehicles, part II
In this second paper, we first show how to estimate the wheelbase length of a vehicle using line metrology in video. We then address the vehicle fingerprinting problem using vehicle silhouettes and color invariants. We combine the acoustic metrology and cl ...
2007(k,lambda)-colorings and universal graphs
Ivo Blöchliger, Daniela Bronner
We consider vertex k-colorings of an arbitrary simple, connected, and undirected graph G=(V,E) such that, for every vertex v, at most lambda different colors occur in the closed neighborhood of v. These colorings are called (k,lambda)-colorings. If a graph ...
2006Scheduling with Multiprocessors: A rounding network algorithm with a constant error
The candidate will study some special cases of preemptive open shop problems with multiprocessors. He will in particular concentrate on the situation when the processor set is partitioned into 2 multiprocessors. The two cases of preemptions (at integral ti ...
2005