Skip to main content
SpringerLink
Log in

A simple linear-time algorithm to recognize interval graphs

  • Specific Algorithms
  • Conference paper
  • First Online:
Graph-Theoretic Concepts in Computer Science (WG 1986)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 246))

Included in the following conference series:

Abstract

The fastest known algorithm for recognizing interval graphs [1] iteratively manipulates the system of all maximal cliques of the given graph in a rather complicated way in order to construct a consecutive arrangement (more precisely: a tree representation of all possible such consecutive arrangements). We present a much simpler algorithm which uses a related, but much more informative tree representation of interval graphs. This tree is constructed in an on-line fashion by adding vertices to the graph in a predefined order such that adding a vertex u takes O(|Adj(u)|) amortized time.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Booth and S. Lueker [1976]: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J. Comput. Syst. Sci. 13, 335–379.

    Google Scholar 

  2. D.R. Fulkerson and O.A. Gross [1965]: Incidence matrices and interval graphs. Pacific J. Math. 15, 835–855.

    Google Scholar 

  3. M.C. Golumbic [1980]: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York.

    Google Scholar 

  4. N. Korte and R.H. Möhring [1985]: Transitive orientation of graphs with side constraints. Proceedings “Workshop on Graphtheoretic Concepts in Computer Science 1985” (ed. H. Noltemeier) Trauner, Linz, p. 143–160.

    Google Scholar 

  5. D.J. Rose, R.E. Tarjan, and G.S. Lueker [1976]: Algorithmic aspects of vertex elimination of graphs. SIAM J. Comput. 5, 266–283.

    Article  Google Scholar 

  6. R.E. Tarjan Amortized computational complexity. SIAM J. Alg. Disc. Math., to appear

    Google Scholar 

  7. R.E. Tarjan and M. Yannakakis [1984]: Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM J. Comput. 13, 566–579.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Bonn

    Norbert Korte & Rolf H. Möhring

Authors
  1. Norbert Korte
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rolf H. Möhring
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Gottfried Tinhofer Gunther Schmidt

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Korte, N., Möhring, R.H. (1987). A simple linear-time algorithm to recognize interval graphs. In: Tinhofer, G., Schmidt, G. (eds) Graph-Theoretic Concepts in Computer Science. WG 1986. Lecture Notes in Computer Science, vol 246. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-17218-1_45

Download citation

  • DOI: https://doi.org/10.1007/3-540-17218-1_45

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-17218-5

  • Online ISBN: 978-3-540-47415-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation