@inproceedings{906b41f9fc174298a51f316023004d21,

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 = "???core.languages.en_GB???",

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",

note = "null ; Conference date: 14-12-1998 Through 16-12-1998",

}