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.
@inproceedings{BroersmaDK97,
title = {Algorithms for the Treewidth and Minimum Fill-in of HHD-Free Graphs},
author = {Hajo Broersma and Elias Dahlhaus and Ton Kloks},
year = {1997},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/BroersmaDK97},
cites = {0},
citedby = {0},
pages = {109-117},
booktitle = {Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, WG 97, Berlin, Germany, June 18-20, 1997, Proceedings},
editor = {Rolf H. Möhring},
volume = {1335},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-63757-5},
}