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

@inproceedings{Golumbic2002ColoringAF,
  title={Coloring Algorithms for Tolerance Graphs: Reasoning and Scheduling with Interval Constraints},
  author={M. Golumbic and Assaf Siani},
  booktitle={AISC},
  year={2002}
}
Interval relations play a significant role in constraint-based temporal reasoning, resource allocation and scheduling problems. For example, the intervals may represent events in time which may conflict or may be compatible, or they may represent tasks to be performed according to a timetable which must be assigned distinct resources like processors or people. In previous work [G93, GS93, G98], we explored the interaction between the interval algebras studied in artificial intelligence and the… Expand
A New Intersection Model and Improved Algorithms for Tolerance Graphs
TLDR
This article proposes the first non-trivial intersection model for general tolerance graphs, given by three-dimensional parallelepipeds, which extends the widely known intersection model of parallelograms in the plane that characterizes the class of bounded tolerance graphs. Expand
A New Intersection Model and Improved Algorithms for Tolerance Graphs
TLDR
This article proposes the first non-trivial intersection model for general tolerance graphs, given by three-dimensional parallelepipeds, which extends the widely known intersection model of parallelograms in the plane that characterizes the class of bounded tolerance graphs. Expand
Mutual exclusion scheduling with interval graphs or related classes, Part I
  • F. Gardi
  • Computer Science, Mathematics
  • Discret. Appl. Math.
  • 2009
TLDR
This paper addresses the mutual exclusion scheduling problem and reinforces the NP-hardness result of Bodlaender and Jansen, and obtains a more precise cartography of the complexity of the problem for the classes of graphs studied. Expand
Mutual exclusion scheduling with interval graphs or related classes. Part I
In this paper, the mutual exclusion scheduling problem is addressed. Given a simple and undirected graph G and an integer k, the problem is to find a minimum coloring of G such that each color isExpand
The Recognition of Tolerance and Bounded Tolerance Graphs is NP-complete
Tolerance graphs model interval relations in such a way that intervals can tolerate a certain degree of overlap without being in conflict. This class of graphs has been extensively studied, due toExpand
Mutual exclusion scheduling with interval graphs or related classes. Part II
  • F. Gardi
  • Computer Science
  • Discret. Appl. Math.
  • 2008
TLDR
The following proposition is demonstrated: if an interval graph G admits a coloring such that each color appears at least k times, then χ(G, k) = dn/ke, and this proposition is extended to several classes of graphs related to interval graphs. Expand
The Recognition of Tolerance and Bounded Tolerance Graphs
TLDR
This article proves that both recognition problems are NP-complete, even in the case where the input graph is a trapezoid graph, and extends the notion of an acyclic orientation of permutation and trapezoids graphs. Expand
New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs
TLDR
It is surprisingly proved that the dominating set problem can be solved in polynomial time on tolerance graphs and that it is APX-hard on multitolerance graphs, solving thus a longstanding open problem. Expand
An Intersection Model for Multitolerance Graphs: Efficient Algorithms and Hierarchy
TLDR
The first non-trivial intersection model for multitolerance graphs is introduced, given by objects in the 3-dimensional space called trapezoepipeds, which implies an optimal O(nlogn) time algorithm for the maximum weight independent set problem on tolerance graphs, thus closing the complexity gap for this problem. Expand
New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs
TLDR
This paper introduces two new geometric representations for tolerance and multitolerance graphs, given by points and line segments in the plane. Expand
...
1
2
...

References

SHOWING 1-10 OF 14 REFERENCES
Complexity and algorithms for reasoning about time: a graph-theoretic approach
TLDR
This work unifies notions of interval algebras in artificial intelligence with those of interval orders and interval graphs in combinatorics and shows that even when the temporal data comprises of subsets of relations based on intersection and precedence only, the satisfiability question is NP-complete. Expand
Trapezoid Graphs and Generalizations, Geometry and Algorithms
TLDR
This work designs optimal, i.e., O(n log n), algorithms for chromatic number, weighted independent set, clique cover and maximum weighted clique on trapezoid graphs and proposes a new class of graphs called circle trapezoidal graphs, which contains trapezoids graphs, circle graphs and circular-arc graphs as subclasses. Expand
Tolerance graphs, and orders
We show that, if a tolerance graph is the complement of a comparability graph, it is a trapezoid graph, i.e., the complement of an order of interval dimension at most 2. As consequences we are ableExpand
Algorithms for Weakly Triangulated Graphs
A graph G = (V.E) is said to be weakly triangulated if neither G not G, the complement of G, contain chordless or induced cycles of length greater than four. Ryan Hayward showed that weaklyExpand
Reasoning About Time
TLDR
This work states that the transitivity of “before” and “contains” may allow us to infer information regarding the sequence of events, which is essential in story understanding, planning and causal reasoning. Expand
Algorithmic graph theory and perfect graphs
Algorithmic Graph Theory and Perfect Graphs, first published in 1980, has become the classic introduction to the field. This new Annals edition continues to convey the message that intersection graphExpand
Optimizing weakly triangulated graphs
TLDR
An algorithm which runs inO((n + e)n3) time is presented which solves the maximum clique and minimum colouring problems for weakly triangulated graphs; performing the algorithm on the complement gives a solution to the maximum stable set and minimum clique covering problems. Expand
Optimizing weakly triangulated graphs
TLDR
An algorithm which runs inO((n + e)n3) time is presented which solves the maximum clique and minimum colouring problems for weakly triangulated graphs; performing the algorithm on the complement gives a solution to the maximum stable set and minimum clique covering problems. Expand
Stability number and chromatic number of tolerance graphs
TLDR
This paper presents algorithms to compute the stability number, the cliqueNumber, the chromatic number, and theClique cover number of a tolerance graph. Expand
Proper and Unit Tolerance Graphs
We answer a question of Golumbic, Monma and Trotter by constructing proper tolerance graphs that are not unit tolerance graphs. An infinite family of graphs that are minimal in this respect isExpand
...
1
2
...