External Links

Cite Key

Statistics

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

PDF

Tags

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.

Algorithms for the Treewidth and Minimum Fill-in of HHD-Free Graphs

Hajo Broersma, Elias Dahlhaus, Ton Kloks. Algorithms for the Treewidth and Minimum Fill-in of HHD-Free Graphs. In Rolf H. Möhring, editor, Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, WG 97, Berlin, Germany, June 18-20, 1997, Proceedings. Volume 1335 of Lecture Notes in Computer Science, pages 109-117, Springer, 1997.

Bibliographies

    runs on