Skip to main content
SpringerLink
Log in

Characterizing and Computing Minimal Cograph Completions

  • Conference paper
Frontiers in Algorithmics (FAW 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5059))

Included in the following conference series:

Abstract

A cograph completion of an arbitrary graph G is a cograph supergraph of G on the same vertex set. Such a completion is called minimal if the set of edges added to G is inclusion minimal. In this paper we present two results on minimal cograph completions. The first is a a characterization that allows us to check in linear time whether a given cograph completion is minimal. The second result is a vertex incremental algorithm to compute a minimal cograph completion H of an arbitrary input graph G in O(V(H) + E(H)) time.

This work is supported by the Research Council of Norway through grant 166429/V30.

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

Access this chapter

Log in via an institution
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.

References

  1. Berry, A., Heggernes, P., Villanger, Y.: A vertex incremental approach for dynamically maintaining chordal graphs. Discrete Math. 306, 318–336 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  2. Blair, J., Heggernes, P., Telle, J.A.: A practical algorithm for making filled graphs minimal. Theoretical Computer Science 250, 125–141 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bodlaender, H.L., Koster, A.M.C.A.: Safe separators for treewidth. Discrete Math. 306, 337–350 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  4. Brandstädt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. In: SIAM Monographs on Discrete Mathematics and Applications (1999)

    Google Scholar 

  5. Burzyn, P., Bonomo, F., Durán, G.: NP-completeness results for edge modification problems. Disc. Appl. Math. 154, 1824–1844 (2006)

    Article  MATH  Google Scholar 

  6. Corneil, D.G., Lerchs, H., Stewart, L.K.: Complement reducible graphs. Disc. Appl. Math. 3, 163–174 (1981)

    Article  MATH  Google Scholar 

  7. Corneil, D.G., Perl, Y., Stewart, L.K.: A linear recognition algorithm for cographs. SIAM J. Comput. 14, 926–934 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  8. El-Mallah, E., Colbourn, C.: The complexity of some edge deletion problems. IEEE Transactions on Circuits and Systems 35, 354–362 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  9. Fomin, F.V., Kratsch, D., Todinca, I.: Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 568–580. Springer, Heidelberg (2004)

    Google Scholar 

  10. Goldberg, P.W., Golumbic, M.C., Kaplan, H., Shamir, R.: Four strikes against physical mapping of DNA. J. Comput. Bio. 2(1), 139–152 (1995)

    Article  Google Scholar 

  11. Golumbic, M.C., Kaplan, H., Shamir, R.: Graph sandwich problems. J. Algorithms 19, 449–473 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  12. Heggernes, P., Mancini, F.: Minimal Split Completions of Graphs. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol. 3887, pp. 592–604. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  13. Heggernes, P., Mancini, F., Papadopoulos, C.: Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol. 4288, pp. 419–428. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  14. Heggernes, P., Papadopoulos, C.: Single-Edge Monotonic Sequences of Graphs and Linear-Time Algorithms for Minimal Completions and Deletions. In: Lin, G. (ed.) COCOON 2007. LNCS, vol. 4598, pp. 406–416. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  15. Heggernes, P., Suchan, K., Todinca, I., Villanger, Y.: Characterizing Minimal Interval Completions. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol. 4393, pp. 236–247. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  16. Heggernes, P., Telle, J.A., Villanger, Y.: Computing minimal triangulations in time O(n αlogn) = o(n 2.376). In: Proceedings of SODA 2005 - 16th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 907–916 (2005)

    Google Scholar 

  17. Kashiwabara, T., Fujisawa, T.: An NP-complete problem on interval graphs. In: IEEE Symp. of Circuits and Systems, pp. 82–83 (1979)

    Google Scholar 

  18. Natanzon, A., Shamir, R., Sharan, R.: A polynomial approximation algorithm for the minimum fill-in problem. In: Proceedings of STOC 1998 - 30th Annual ACM Symposium on Theory of Computing, pp. 41–47 (1998)

    Google Scholar 

  19. Cai, L.: Fixed-Parameter Tractability of Graph Modification Problems for Hereditary Properties. Inf. Process. Lett. 58(4), 171–176 (1996)

    Article  MATH  Google Scholar 

  20. Kaplan, H., Shamir, R., Tarjan, R.E.: Tractability of parameterized completion problems on chordal and interval graphs: Minimum Fill-in and Physical Mapping. In: Proceedings of FOCS 2004 - 35th Annual Symposium on Foundations of Computer Science, pp. 780–791 (2004)

    Google Scholar 

  21. Heggernes, P., Paul, C., Telle, J.A., Villanger, Y.: Interval Completion is Fixed Parameter Tractable. In: Proceedings of STOC 2007 - 39th Annual ACM Symposium on Theory of Computing, pp. 374–381 (2007)

    Google Scholar 

  22. Dom, M., Guo, J., Hüffner, F., Niedermeier, R.: Error Compensation in Leaf Power Problems. Algorithmica 44(4), 363–381 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  23. Natanzon, A., Shamir, R., Sharan, R.: Complexity classification of some edge modification problems. Disc. Appl. Math. 113, 109–128 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  24. Nikolopoulos, S.D., Palios, L.: Adding an Edge in a Cograph. In: Kratsch, D. (ed.) WG 2005. LNCS, vol. 3787, pp. 214–226. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  25. Rapaport, I., Suchan, K., Todinca, I.: Minimal Proper Interval Completions. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol. 4271, pp. 217–228. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  26. Rose, D.J.: A graph-theoretic study of the numerical solution of sparse positive definite systems of linear equations. In: Read, R.C. (ed.) Graph Theory and Computing, pp. 183–217. Academic Press, New York (1972)

    Google Scholar 

  27. Suchan, K., Todinca, I.: Minimal Interval Completion Through Graph Exploration. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol. 4288, pp. 517–526. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  28. Bodlaender, H.L., Kloks, T., Kratsch, D., Müller, H.: Treewidth and Minimum Fill-in on d-Trapezoid Graphs. J. Graph Algorithms Appl. 2(5), 1–28 (1998)

    MathSciNet  Google Scholar 

  29. Kloks, T., Kratsch, D., Spinrad, J.: On treewidth and minimum fill-in of asteroidal triple-free graphs. Theor. Comput. Sci. 175(2), 309–335 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  30. Broersma, H.J., Dahlhaus, E., Kloks, T.: A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs. Discrete Applied Mathematics 99(1), 367–400 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  31. Kloks, T., Kratsch, D., Wong, C.K.: Minimum Fill-in on Circle and Circular-Arc Graphs. Journal of Algorithms 28(2), 272–289 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  32. Mancini, F.: Minimum Fill-In and Treewidth of Split+ ke and Split+ kv Graphs. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol. 4835, pp. 881–892. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  33. Yannakakis, M.: Computing the minimum fill-in is NP-complete. SIAM J. Alg. Disc. Meth. 2, 77–79 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  34. Berry, A., Heggernes, P., Simonet, G.: The Minimum Degree Heuristic and the Minimal Triangulation Process. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol. 2880, pp. 58–70. Springer, Heidelberg (2003)

    Google Scholar 

  35. Bouchitté, V., Todinca, I.: Treewidth and Minimum Fill-in: Grouping the Minimal Separators. SIAM J. Comput. 31(1), 212–232 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  36. Villanger, Y.: Improved Exponential-Time Algorithms for Treewidth and Minimum Fill-In. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol. 3887, pp. 800–811. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  37. Heggernes, P., Mancini, F.: Dinamically Mantaining Split Graphs. Tech report: http://www.ii.uib.no/~federico/papers/dynsplit-rev2.pdf

  38. Bretscher, A., Corneil, D.G., Habib, M., Paul, C.: A Simple Linear Time LexBFS Cograph Recognition Algorithm. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol. 2880, pp. 119–130. Springer, Heidelberg (2003)

    Google Scholar 

  39. Aho, A.V., Hopcroft, I.E., Ullman, J.D.: The design and analysis of computer algorithms, ex. 2.12, p. 71. Addison-Wesley, Reading (1974)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Informatics, University of Bergen, N-5020, Bergen, Norway

    Daniel Lokshtanov, Federico Mancini & Charis Papadopoulos

Authors
  1. Daniel Lokshtanov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Federico Mancini
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Charis Papadopoulos
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Franco P. Preparata Xiaodong Wu Jianping Yin

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lokshtanov, D., Mancini, F., Papadopoulos, C. (2008). Characterizing and Computing Minimal Cograph Completions. In: Preparata, F.P., Wu, X., Yin, J. (eds) Frontiers in Algorithmics. FAW 2008. Lecture Notes in Computer Science, vol 5059. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69311-6_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-69311-6_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-69310-9

  • Online ISBN: 978-3-540-69311-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation