Sign Up to like & get
recommendations!
0
Published in 2019 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-019-00388-z
Abstract: Coloring of mixed graphs that contain both directed arcs and undirected edges is relevant for scheduling of unit-length jobs with precedence constraints and conflicts. The classic GHRV theorem (attributed to Gallai, Hasse, Roy, and Vitaver)…
read more here.
Keywords:
mixed graphs;
parameterized mixed;
graph coloring;
mixed graph ... See more keywords