Skip to main content
SpringerLink
Log in

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

  • Conference paper
  • First Online:
Artificial Intelligence, Automated Reasoning, and Symbolic Computation (AISC 2002, Calculemus 2002)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2385))

Abstract

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 interval graphs and orders studied in combinatorial mathematics, extending results in both disciplines.

In this paper, we investigate algorithmic problems on tolerance graphs, a family which generalizes interval graphs, and which therefore have broader application. Tolerance graph models can represent qualitative and quantitative relations in situations where the intervals can tolerate a certain degree of overlap without being in conflict. We present a coloring algorithm for a tolerance graph on n vertices whose running time is O(n 2), given the tolerance representation, thus improving previously known results. The coloring problem on intervals has direct application to resource allocation and scheduling temporal processes.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. K. Bogart, P. Fishburn, G. Isaak and P. Langley, Proper and unit tolerance graphs, Discrete Applied Math. 60 (1995) 37–51.

    MathSciNet  Google Scholar 

  2. S. Felsner, Tolerance graphs and orders, J. of Graph Theory 28 (1998) 129–140.

    Article  MATH  MathSciNet  Google Scholar 

  3. S. Felsner, R. Müller, L. Wernisch, Trapezoid graphs and generalizations, geometry and algorithms, Discrete Applied Math. 74 (1997) 13–32.

    Article  MATH  Google Scholar 

  4. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.

    MATH  Google Scholar 

  5. M.C. Golumbic, Reasoning about time, Invited talk, AISMC-1 Karlsruhe, Germany, August 3–6, 1992, abstract in LNCS 737 (1993) p. 276.

    Google Scholar 

  6. M.C. Golumbic, Reasoning about time, in “Mathematical Aspects of Artificial Intelligence”, F. Hoffman, ed., American Math. Society, Proc. Symposia in Applied Math., vol. 55, 1998, pp. 19–53.

    Google Scholar 

  7. M.C. Golumbic and C.L. Monma, A generalization of interval graphs with tolerances, in: Proceedings 13th Southeastern Conference on Combinatorics, Graph Theory and Computing, Congressus Numerantium 35 (1982) 321–331.

    MathSciNet  Google Scholar 

  8. M.C. Golumbic, C.L. Monma and W.T. Trotter Jr., Tolerance graphs, Discrete Applied Math. 9 (1984) 157–170.

    Article  MATH  MathSciNet  Google Scholar 

  9. M.C. Golumbic and R. Shamir, Complexity and algorithms for reasoning about time: a graph-theoretic approach, J. Assoc. Comput. Mach. 40 (1993), 1108–1133.

    MATH  MathSciNet  Google Scholar 

  10. M.C. Golumbic and Ann N. Trenk, Tolerance Graphs, monograph in preparation.

    Google Scholar 

  11. R. Hayward, Weakly triangulated graphs, J. Combin. Theo. Ser. B 39 (1985) 200–209.

    Article  MATH  MathSciNet  Google Scholar 

  12. R. Hayward, C. Hoàng, and F. Maffray, Optimizing weakly triangulated graphs, Graphs and Combinatorics 6 (1990) 33–35. Erratum to ibid, 5:339–349.

    Article  MATH  MathSciNet  Google Scholar 

  13. L. Lovász, Normal hypergraphs and the perfect graph conjecture, Discrete Math. 2 (1972), 253–267.

    Article  MATH  MathSciNet  Google Scholar 

  14. G. Narasimhan and R. Manber, Stability number and chromatic number of tolerance graphs. Discrete Applied Math. 36 (1992) 47–56.

    Article  MATH  MathSciNet  Google Scholar 

  15. A. Raghunathan, Algorithms for weakly triangulated graphs, Univ. of Calif. Berkeley, Technical Report CSD-89-503 (April 1989).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, University of Haifa, Haifa, Israel

    Martin Charles Golumbic

  2. Dept. of Computer Science, Bar-Ilan University, Ramat-Gan, Israel

    Assaf Siani

Authors
  1. Martin Charles Golumbic
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Assaf Siani
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Karlsruhe (TH), Am Fasanengarten 5, Postfach 6980, D-76128, Karlsruhe, Germany

    Jacques Calmet

  2. CMI, Université de Provence, 39 rue F. Juliot-Curie, 13453, Marseille Cedex 13, France

    Belaid Benhamou

  3. Research Institute for Symbolic Computation (RISC-Linz), Johannes Kepler University, A-4040, Linz, Austria

    Olga Caprotti

  4. ESIL, Université de la Méditerannée, 163 Avenue de Luminy, Marseille Cedex 09, France

    Laurent Henocque

  5. School of Computer Science, University of Birmingham, Birmingham, B15 2TT, UK

    Volker Sorge

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Golumbic, M.C., Siani, A. (2002). Coloring Algorithms for Tolerance Graphs: Reasoning and Scheduling with Interval Constraints. In: Calmet, J., Benhamou, B., Caprotti, O., Henocque, L., Sorge, V. (eds) Artificial Intelligence, Automated Reasoning, and Symbolic Computation. AISC Calculemus 2002 2002. Lecture Notes in Computer Science(), vol 2385. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45470-5_19

Download citation

  • DOI: https://doi.org/10.1007/3-540-45470-5_19

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43865-6

  • Online ISBN: 978-3-540-45470-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation