External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In

Fedor V. Fomin, Dieter Kratsch, Ioan Todinca. Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In. In Josep Díaz, Juhani Karhumäki, Arto Lepistö, Donald Sannella, editors, Automata, Languages and Programming: 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004. Proceedings. Volume 3142 of Lecture Notes in Computer Science, pages 568-580, Springer, 2004. [doi]

Authors

Fedor V. Fomin

This author has not been identified. Look up 'Fedor V. Fomin' in Google

Dieter Kratsch

This author has not been identified. Look up 'Dieter Kratsch' in Google

Ioan Todinca

This author has not been identified. Look up 'Ioan Todinca' in Google
runs on