Parameterized Mixed Graph Coloring
Sign Up to like & getrecommendations! 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
Relations between the inertia indices of a mixed graph and those of its underlying graph
Sign Up to like & getrecommendations! Published in 2020 at "Linear Algebra and its Applications"
DOI: 10.1016/j.laa.2019.11.018
Abstract: Abstract Given a graph G, the mixed graph D G is obtained from G by orienting some of its edges, where G is called the underlying graph of D G . Let p ( D… read more here.
Keywords: mixed graph; indices mixed; underlying graph; graph ... See more keywords
Mixed Graph Colouring as Scheduling a Partially Ordered Set of Interruptible Multi-Processor Tasks with Integer Due Dates
Sign Up to like & getrecommendations! Published in 2024 at "Algorithms"
DOI: 10.3390/a17070299
Abstract: We investigate relationships between scheduling problems with the bottleneck objective functions (minimising makespan or maximal lateness) and problems of optimal colourings of the mixed graphs. The investigated scheduling problems have integer durations of the multi-processor… read more here.
Keywords: processor tasks; mixed graph; integer due; scheduling problems ... See more keywords