Algorithmica

, Volume 78, Issue 3, pp 945–967 | Cite as

Extending Partial Representations of Interval Graphs

  • Pavel Klavík
  • Jan Kratochvíl
  • Yota Otachi
  • Toshiki Saitoh
  • Tomáš Vyskočil
Article

Abstract

Interval graphs are intersection graphs of closed intervals of the real-line. The well-known computational problem, called recognition, asks whether an input graph G can be represented by closed intervals, i.e., whether G is an interval graph. There are several linear-time algorithms known for recognizing interval graphs, the oldest one is by Booth and Lueker (J Comput Syst Sci 13:335–379, 1976) based on PQ-trees. In this paper, we study a generalization of recognition, called partial representation extension. The input of this problem consists of a graph G with a partial representation \({{{\mathcal {R}}}}'\) fixing the positions of some intervals. The problem asks whether it is possible to place the remaining interval and create an interval representation \({{{\mathcal {R}}}}\) of the entire graph G extending \({{{\mathcal {R}}}}'\). We generalize the characterization of interval graphs by Fulkerson and Gross (Pac J Math 15:835–855, 1965) to extendible partial representations. Using it, we give a linear-time algorithm for partial representation extension based on a reordering problem of PQ-trees.

Keywords

Interval graphs Partial representation extension PQ-trees Linear-time algorithm 

References

  1. 1.
    Angelini, P., Di Battista, G., Frati, F., Jelínek, V., Kratochvíl, J., Patrignani, M., Rutter, I.: Testing planarity of partially embedded graphs. ACM Trans. Algorithms 11(4), 32:1–32:42 (2015)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Balko, M., Klavík, P., Otachi, Y.: Bounded representations of interval and proper interval graphs. In: Algorithms and Computation, Lecture Notes in Computer Science, vol. 8283, pp. 535–546. Springer, Berlin (2013)Google Scholar
  3. 3.
    Bang-Jensen, J., Huang, J., Zhu, X.: Completing orientations of partially oriented graphs. CoRR (2015). arXiv:1509.01301
  4. 4.
    Benzer, S.: On the topology of the genetic fine structure. Proc. Natl. Acad. Sci. USA 45, 1607–1620 (1959)CrossRefGoogle Scholar
  5. 5.
    Bläsius, T., Rutter, I.: Simultaneous PQ-ordering with applications to constrained embedding problems. ACM Trans. Algorithms 12(2), 16:1–16:46 (2015)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and planarity using PQ-tree algorithms. J. Comput. Syst. Sci. 13, 335–379 (1976)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    Chaplick, S., Dorbec, P., Kratochvíl, J., Montassier, M., Stacho, J.: Contact representations of planar graphs: extending a partial representation is hard. In: Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science, pp. 139–151 (2014)Google Scholar
  8. 8.
    Chaplick, S., Fulek, R., Klavík, P.: Extending partial representations of circle graphs. In: Graph Drawing, Lecture Notes in Computer Science, vol. 8242, pp. 131–142. Springer, Berlin (2013)Google Scholar
  9. 9.
    Chaplick, S., Guśpiel, G., Gutowski, G., Krawczyk, T., Liotta, G.: The partial visibility representation extension problem. CoRR (2015). arXiv:1512.00174
  10. 10.
    Corneil, D.G., Olariu, S., Stewart, L.: The LBFS structure and recognition of interval graphs. SIAM J. Discrete Math. 23(4), 1905–1953 (2009)MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    Fishburn, P.: Interval Orders and Interval Graphs: A Study of Partially Ordered Sets. Wiley, New York (1985)MATHGoogle Scholar
  12. 12.
    Fulkerson, D.R., Gross, O.A.: Incidence matrices and interval graphs. Pac. J. Math. 15, 835–855 (1965)MathSciNetCrossRefMATHGoogle Scholar
  13. 13.
    Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. North-Holland Publishing Co, Amsterdam (2004)MATHGoogle Scholar
  14. 14.
    Habib, M., McConnell, R., Paul, C., Viennot, L.: Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing. Theor. Comput. Sci. 234, 59–84 (2000)MathSciNetCrossRefMATHGoogle Scholar
  15. 15.
    Hajós, G.: Über eine Art von Graphen. Int. Math. Nachr. 11, 65 (1957)Google Scholar
  16. 16.
    Hsu, W.: \(O(M \cdot N)\) algorithms for the recognition and isomorphism problems on circular-arc graphs. SIAM J. Comput. 24(3), 411–439 (1995)MathSciNetCrossRefMATHGoogle Scholar
  17. 17.
    Jampani, K.R., Lubiw, A.: Simultaneous interval graphs. In: Algorithms and Computation, Lecture Notes in Computer Science, vol. 6506, pp. 206–217 (2010)Google Scholar
  18. 18.
    Jampani, K.R., Lubiw, A.: The simultaneous representation problem for chordal, comparability and permutation graphs. J. Graph Algortihms Appl. 16(2), 283–315 (2012)MathSciNetCrossRefMATHGoogle Scholar
  19. 19.
    Klavík, P., Kratochvíl, J., Krawczyk, T., Walczak, B.: Extending partial representations of function graphs and permutation graphs. In: Algorithms—ESA 2012, Lecture Notes in Computer Science, vol. 7501, pp. 671–682 (2012)Google Scholar
  20. 20.
    Klavík, P., Kratochvíl, J., Otachi, Y., Rutter, I., Saitoh, T., Saumell, M., Vyskočil, T.: Extending partial representations of proper and unit interval graphs. Algorithmica (2016). doi:10.1007/s00453-016-0133-z
  21. 21.
    Klavík, P., Kratochvíl, J., Otachi, Y., Saitoh, T.: Extending partial representations of subclasses of chordal graphs. Theor. Comput. Sci. 576, 85–101 (2015)MathSciNetCrossRefMATHGoogle Scholar
  22. 22.
    Klavík, P., Kratochvíl, J., Vyskočil, T.: Extending partial representations of interval graphs. In: Theory and Applications of Models of Computation—8th Annual Conference, TAMC 2011, Lecture Notes in Computer Science, vol. 6648, pp. 276–285 (2011)Google Scholar
  23. 23.
    Klavík, P., Otachi, Y., Šejnoha, J.: On the classes of interval graphs of limited nesting and count of lengths. CoRR (2015). arXiv:1510.03998
  24. 24.
    Klavík, P., Saumell, M.: Minimal obstructions for partial representations of interval graphs. In: Ahn, H.-K., Shin, C.-S. (eds.) Algorithms and Computation, ISAAC 2014. Lecture Notes in Computer Science, vol. 8889, pp. 401–413. Springer International Publishing (2014). http://link.springer.com/chapter/10.1007%2F978-3-319-13075-0_32
  25. 25.
    Kobler, J., Kuhnert, S., Watanabe, O.: Interval graph representation with given interval and intersection lengths. In: Algorithms and Computation, Lecture Notes in Computer Science, vol. 7676, pp. 517–526 (2012)Google Scholar
  26. 26.
    Korte, N., Möhring, R.: An incremental linear-time algorithm for recognizing interval graphs. SIAM J. Comput. 18(1), 68–81 (1989)MathSciNetCrossRefMATHGoogle Scholar
  27. 27.
    Lekkerkerker, C., Boland, D.: Representation of finite graphs by a set of intervals on the real line. Fundam. Math. 51, 45–64 (1962)MathSciNetMATHGoogle Scholar
  28. 28.
    Lindzey, N., McConnell, R.M.: On finding tucker submatrices and Lekkerkerker–Boland subgraphs. In: Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science, vol. 8165, pp. 345–357 (2013)Google Scholar
  29. 29.
    Marczewski, E.S.: Sur deux propriétés des classes d’ensembles. Fundam. Math. 33, 303–307 (1945)MATHGoogle Scholar
  30. 30.
    McConnell, R.M.: Linear-time recognition of circular-arc graphs. Algorithmica 37(2), 93–147 (2003)MathSciNetCrossRefMATHGoogle Scholar
  31. 31.
    McKee, T.A., McMorris, F.R.: Topics in Intersection Graph Theory. SIAM Monographs on Discrete Mathematics and Applications, vol. 2. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA (1999)Google Scholar
  32. 32.
    Patrignani, M.: On extending a partial straight-line drawing. In: GD’2006, Lecture Notes in Computer Science, vol. 3843, pp. 380–385 (2006)Google Scholar
  33. 33.
    Pe’er, I., Shamir, R.: Realizing interval graphs with size and distance constraints. SIAM J. Discrete Math. 10(4), 662–687 (1997)MathSciNetCrossRefMATHGoogle Scholar
  34. 34.
    Roberts, F.S.: Indifference graphs. Proof Tech. Graph Theory 139, 146 (1969)MATHGoogle Scholar
  35. 35.
    Roberts, F.S.: Discrete Mathematical Models, with Applications to Social, Biological, and Environmental Problems. Prentice-Hall, Englewood Cliffs (1976)MATHGoogle Scholar
  36. 36.
    Rose, D.J., Tarjan, R.E., Lueker, G.S.: Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput. 5(2), 266–283 (1976)MathSciNetCrossRefMATHGoogle Scholar
  37. 37.
    Soulignac, F.J.: Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. CoRR (2014). arXiv:1408.3443
  38. 38.
    Spinrad, J.P.: Efficient Graph Representations. Field Institute Monographs. American Mathematical Society (2003)Google Scholar
  39. 39.
    Stoffers, K.E.: Scheduling of traffic lights—a new approach. Transp. Res. 2, 199–234 (1968)CrossRefGoogle Scholar
  40. 40.
    Trotter, W.T.: New perspectives on interval orders and interval graphs. In: Bailey, R.A. (ed.) In Surveys in Combinatorics, pp. 237–286. Cambridge University Press, Cambridge (1997)Google Scholar
  41. 41.
    Zeman, P.: Extending partial representations of subclasses of circular-arc graphs (2016, in preparation)Google Scholar

Copyright information

© Springer Science+Business Media New York 2016

Authors and Affiliations

  • Pavel Klavík
    • 1
  • Jan Kratochvíl
    • 2
  • Yota Otachi
    • 3
  • Toshiki Saitoh
    • 4
  • Tomáš Vyskočil
    • 5
  1. 1.Computer Science Institute, Faculty of Mathematics and PhysicsCharles University in PraguePragueCzech Republic
  2. 2.Department of Applied Mathematics, Faculty of Mathematics and PhysicsCharles University in PraguePragueCzech Republic
  3. 3.School of Information ScienceJapan Advanced Institute of Science and TechnologyNomiJapan
  4. 4.Graduate School of EngineeringKobe UniversityKobeJapan
  5. 5.Department of Computer ScienceRutgers, The State University of New JerseyPiscatawayUSA

Personalised recommendations