Hajo Broersma, Elias Dahlhaus, Ton Kloks. A Linear Time Algorithm for Minimum Fill-in and Treewidth for Distance Hereditary Graphs. Discrete Applied Mathematics, 99(1-3):367-400, 2000. [doi]
@article{BroersmaDK00,
title = {A Linear Time Algorithm for Minimum Fill-in and Treewidth for Distance Hereditary Graphs},
author = {Hajo Broersma and Elias Dahlhaus and Ton Kloks},
year = {2000},
doi = {10.1016/S0166-218X(99)00146-8},
url = {http://dx.doi.org/10.1016/S0166-218X(99)00146-8},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/BroersmaDK00},
cites = {0},
citedby = {0},
journal = {Discrete Applied Mathematics},
volume = {99},
number = {1-3},
pages = {367-400},
}