The circular arc coloring problem is the problem of finding a minimal coloring of a set of arcs on a circle so that if two arcs intersect then they are assigned different colors. When a generic set of circular arcs is to be colored, the problem is known to be NP-complete; we consider certain instances of the problem which can be optimally solved in polynomial time.
Coloring Circular Arcs with Applications
GARGANO, Luisa;RESCIGNO, Adele Anna
2000-01-01
Abstract
The circular arc coloring problem is the problem of finding a minimal coloring of a set of arcs on a circle so that if two arcs intersect then they are assigned different colors. When a generic set of circular arcs is to be colored, the problem is known to be NP-complete; we consider certain instances of the problem which can be optimally solved in polynomial time.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
