@inproceedings{1495039a49254bdc8a136c71d96abca7,
title = "Dynamic programming on distance-hereditary graph",
abstract = "In this paper, we define a one-vertex-extension tree for a distance-hereditary graph and show how to build it. We then give a unified approach to designing efficient dynamic programming algorithms for distance-hereditary graphs based upon the one-vertex-extension tree. We give linear time algorithms for the weighted vertex cover and weighted independent domination problems and give an 0(n2) time algorithm to compute a minimum fill-in and the treewidth for a distance-hereditary graph.",
author = "Chang, {Maw Shang} and Hsieh, {Sun Yuan} and Chen, {Gen Huey}",
year = "1997",
doi = "10.1007/3-540-63890-3_37",
language = "English",
isbn = "3540638903",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "344--353",
editor = "Leong, {Hon Wai} and Sanjay Jain and Hiroshi Imai",
booktitle = "Algorithms and Computation - 8th International Symposium, ISAAC 1997, Proceedings",
address = "Germany",
note = "8th Annual International Symposium on Algorithms and Computation, ISAAC 1997 ; Conference date: 17-12-1997 Through 19-12-1997",
}