Skip to main content
SpringerLink
Log in

Faster Parameterized Algorithms for Minimum Fill-In

  • Conference paper
Algorithms and Computation (ISAAC 2008)

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

Included in the following conference series:

Abstract

We present two parameterized algorithms for the Minimum Fill-In problem, also known as Chordal Completion: given an arbitrary graph G and integer k, can we add at most k edges to G to obtain a chordal graph? Our first algorithm has running time , and requires polynomial space. This improves the base of the exponential part of the best known parameterized algorithm time for this problem so far. We are able to improve this running time even further, at the cost of more space. Our second algorithm has running time and requires space.

Supported by the Research Council of Norway.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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., Bordat, J.: Moplex elimination orderings. Electronic notes in Discrete Mathematics 8, 6–9 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  2. Berry, A., Heggernes, P., Villanger, Y.: A vertex incremental approach for maintaining chordality. Discrete Mathematics 306, 318–336 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bodlaender, H.L., Heggernes, P., Villanger, Y.: Faster parameterized algorithms for Minimum Fill-In, Technical Report Reports in Informatics 375, University of Bergen, Norway (2008)

    Google Scholar 

  4. Bouchitté, V., Todinca, I.: Listing all potential maximal cliques of a graph. Theoret. Comput. Sci. 276, 17–32 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  5. Buneman, P.: A characterization of rigid circuit graphs. Discrete Math. 9, 205–212 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  6. Cai, L.: Fixed-parameter tractability of graph modification problems for heriditary properties. Inf. Process. Lett. 58, 171–176 (1996)

    Article  MATH  Google Scholar 

  7. Downey, R.G., Fellows, M.R.: Parameterized complexity. Springer, New York (1999)

    Book  MATH  Google Scholar 

  8. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, New York (2006)

    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)

    Chapter  Google Scholar 

  10. Fomin, F.V., Villanger, Y.: Treewidth computation and extremal combinatorics. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 210–221. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  11. Gavril, F.: The intersection graphs of subtrees in trees are exactly the chordal graphs. J. Combin. Theory Ser. B 16, 47–56 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  12. Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980)

    MATH  Google Scholar 

  13. Heggernes, P.: Minimal triangulations of graphs: A survey. Discrete Mathematics 306, 297–317 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  14. Kaplan, H., Shamir, R., Tarjan, R.E.: Tractability of parameterized completion problems on chordal and interval graphs: Minimum fill-in and physical mapping. In: IEEE Symposium on Foundations of Computer Science, pp. 780–791 (1994)

    Google Scholar 

  15. Kaplan, H., Shamir, R., Tarjan, R.E.: Tractability of parameterized completion problems on chordal, strongly chordal, and proper interval graphs. SIAM J. Computing 28, 1906–1922 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  16. Lauritzen, S.L., Spiegelhalter, D.J.: Local computations with probabilities on graphical structures and their applications to expert systems. J. Royal Statist. Soc.  B 50, 157–224 (1988)

    MathSciNet  MATH  Google Scholar 

  17. Natanzon, A., Shamir, R., Sharan, R.: A polynomial approximation algorithm for the minimum fill-in problem. SIAM J. Computing 30, 1067–1079 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  18. Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)

    Book  MATH  Google Scholar 

  19. Rose, D.J.: Triangulated graphs and the elimination process. J. Math. Anal. Appl. 32, 597–609 (1970)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  21. 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 

  22. Walter, J.: Representations of rigid cycle graphs, PhD thesis, Wayne State University, USA (1972)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information and Computing Sciences, Utrecht University, P.O. Box 80.089, 3508 TB, Utrecht, The Netherlands

    Hans L. Bodlaender

  2. Department of Informatics, University of Bergen, PB 7803, 5020, Bergen, Norway

    Pinar Heggernes & Yngve Villanger

Authors
  1. Hans L. Bodlaender
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pinar Heggernes
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yngve Villanger
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Information Technologies, University of Sydney, Australia

    Seok-Hee Hong

  2. Graduate School of Informatics, Kyoto University, 606-8501, Kyoto, Japan

    Hiroshi Nagamochi

  3. Graduate School of Informatics, Kyoto University, Japan

    Takuro Fukunaga

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bodlaender, H.L., Heggernes, P., Villanger, Y. (2008). Faster Parameterized Algorithms for Minimum Fill-In . In: Hong, SH., Nagamochi, H., Fukunaga, T. (eds) Algorithms and Computation. ISAAC 2008. Lecture Notes in Computer Science, vol 5369. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92182-0_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-92182-0_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-92181-3

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation