Coloring Algorithms for Tolerance Graphs: Reasoning and Scheduling with Interval Constraints.

Martin Charles Golumbic Assaf Siani

Published in: AISC (2002)

Keyphrases

significant improvement
computational complexity
graph theory
np hard
worst case
computationally efficient
combinatorial optimization
parallel processors
learning algorithm
graph matching
bipartite graph
resource constraints
partial solutions
interval arithmetic