Advertisement

Reconstruction of Interval Graphs

  • Masashi Kiyomi
  • Toshiki Saitoh
  • Ryuhei Uehara
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5609)

Abstract

The graph reconstruction conjecture is a long-standing open problem in graph theory. There are many algorithmic studies related it besides mathematical studies, such as DECK CHECKING, LEGITIMATE DECK, PREIMAGE CONSTRUCTION, and PREIMAGE COUNTING. We study these algorithmic problems limiting the graph class to interval graphs. Since we can solve GRAPH ISOMORPHISM for interval graphs in polynomial time, DECK CHECKING for interval graphs is easily done in polynomial time. Since the number of interval graphs that can be obtained from an interval graph by adding a vertex and edges incident to it can be exponentially large, developing polynomial time algorithms for LEGITIMATE DECK, PREIMAGE CONSTRUCTION, and PREIMAGE COUNTING on interval graphs is not trivial. We present that these three problems are solvable in polynomial time on interval graphs.

Keywords

the graph reconstruction conjecture interval graphs polynomial time algorithm 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bondy, J.A.: A graph reconstructor’s manual. In: Surveys in Combinatorics. London Mathematical Society Lecture Note Series, vol. 166, pp. 221–252 (1991)Google Scholar
  2. 2.
    Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. Journal of Computer and System Sciences 13, 335–379 (1976)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Fulkerson, D.R., Gross, O.A.: Incidence matrices and interval graphs. Pacific Journal of Mathematics 15, 835–855 (1965)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Harary, F.: A survey of the reconstruction conjecture. Graphs and Combinatorics. Lecture Notes in Mathematics 406, 18–28 (1974)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Kelly, P.J.: A congruence theorem for trees. Pacific Journal of Mathematics 7, 961–968 (1957)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Korte, N., Möhring, R.H.: An incremental linear-time algorithm for recognizing interval graphs. SIAM Journal on Computing 18, 68–81 (1989)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Kratsch, D., Hemaspaandra, L.A.: On the complexity of graph reconstruction. Mathematical Systems Theory 27, 257–273 (1994)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Leckerkerker, C.G., Boland, J.C.: Representation of a finite graph by a set of intervals on the real line. Fundamenta Mathematicae 51, 45–64 (1962)MathSciNetGoogle Scholar
  9. 9.
    Lueker, G.S., Booth, K.S.: A linear time algorithm for deciding interval graph isomorphism. Journal of the ACM 26, 183–195 (1979)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    von Rimscha, M.: Reconstructibility and perfect graphs. Discrete Mathematics 47, 283–291 (1983)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Uehara, R., Uno, Y.: On computing longest paths in small graph classes. International Journal of Foundations of Computer Science 18, 911–930 (2007)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Masashi Kiyomi
    • 1
  • Toshiki Saitoh
    • 1
  • Ryuhei Uehara
    • 1
  1. 1.School of Information ScienceJAIST, AsahidaiIshikawaJapan

Personalised recommendations