Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Conference Paper
%1 conf/wg/BroersmaDK97
%A Broersma, Hajo
%A Dahlhaus, Elias
%A Kloks, Ton
%B WG
%D 1997
%E Möhring, Rolf H.
%I Springer
%K dblp
%P 109-117
%T Algorithms for the Treewidth and Minimum Fill-in of HHD-Free Graphs.
%U http://dblp.uni-trier.de/db/conf/wg/wg97.html#BroersmaDK97
%V 1335
%@ 3-540-63757-5
@inproceedings{conf/wg/BroersmaDK97,
added-at = {2020-09-05T00:00:00.000+0200},
author = {Broersma, Hajo and Dahlhaus, Elias and Kloks, Ton},
biburl = {https://www.bibsonomy.org/bibtex/2bb78bf7514d77f2d23a00f5966174d0e/dblp},
booktitle = {WG},
crossref = {conf/wg/1997},
editor = {Möhring, Rolf H.},
ee = {https://doi.org/10.1007/BFb0024492},
interhash = {9b4731a2470d54b3acce115034a8b25a},
intrahash = {bb78bf7514d77f2d23a00f5966174d0e},
isbn = {3-540-63757-5},
keywords = {dblp},
pages = {109-117},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
timestamp = {2020-09-09T14:16:26.000+0200},
title = {Algorithms for the Treewidth and Minimum Fill-in of HHD-Free Graphs.},
url = {http://dblp.uni-trier.de/db/conf/wg/wg97.html#BroersmaDK97},
volume = 1335,
year = 1997
}