@inproceedings{1853469645694d1e9b015f73c307b41e,
title = "Characterization of efficiently solvable problems on distance-hereditary graphs",
abstract = "In the literature, there are quite a few sequential and parallel algorithms to solve problems in a distance-hereditary graph G utilizing techniques discovered from the properties of the problems. Based on structural properties of G, we first sketch characteristics of problems which can be systematic solved on G and then define a general problem-solving paradigm. Given a decomposition tree representation of G, we propose a unified approach to construct sequential dynamic-programming algorithms for several fundamental graph-theoretical problems that fit into our paradigm. We also show that our sequential solutions can be efficiently parallelized using the tree contraction technique.",
author = "Hsieh, \{Sun Yuan\} and Ho, \{Chin Wen\} and Hsu, \{Tsan Sheng\} and Ko, \{Ming Tat\} and Chen, \{Gen Huey\}",
year = "1998",
doi = "10.1007/3-540-49381-6\_28",
language = "English",
isbn = "3540653856",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "257--266",
booktitle = "Algorithms and Computation - 9th International Symposium, ISAAC'98, Proceedings",
address = "Germany",
note = "9th Annual International Symposium on Algorithms and Computation, ISAAC'98 ; Conference date: 14-12-1998 Through 16-12-1998",
}