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 O(n 2) time algorithm to compute a minimum fill-in and the treewidth for a distance-hereditary graph.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
S. Arnborg, D. G. Corneil, and A. Proskurowski.: Complexity of finding embeddings in a k-tree. SIAM J. Alg. Disc. Math. (1987) 277–284
H. J. Bandelt, A. Henkmann, and F. Nicolai.: Powers of distance-hereditary graphs. Technical Report SM-DU-220 (1993), University of Duisburg
H. J. Bandelt and H. M. Mulder: Distance-hereditary graphs. J. Comb. Theory. Series B. 41 (1986) 182–208
A. Branstadt and F. F. Dragan.: A linear-time algorithm for connected r-domination and Steiner tree on distance-hereditary graphs. Preprint (1994)
G. J. Chang.: Private communication.
M. S. Chang.: Weighted domination on cocomparability graphs. Lecture Notes in Computer Science. 1001 (1995) 122–131
A. D'atri and M. Moscarini. Distance-hereditary graphs, Steiner trees, and connected domination. SIAM J. Comput. 17 (1988) 521–538
F. F. Dragan. Dominating cliques in distance-hereditary graphs. Technical Report. SM-DU-248 (1994). University of Duisburg
A. H. Esfahanian and O. R. Oellermann. Distance-hereditary graphs and multidestination message-routing in multicomputers. JCMCC. 13 (1993) 213–222
S. T. Hedetniemi and R. C. Laskar. Bibliography on domination in graphs and some basic definitions of domination parameters. Disc. Math. 86 (1990) 257–277
P. L. Hammer and F. Maffray. Completely separable graphs. Disc. Appl. Math. 27 (1990) 85–99
E. Howorka. A characterization of distance-hereditary graphs. Quart. J. Math. Oxford (2) 28 (1977) 417–420
E. Howorka. A characterization of Ptolemaic graphs. J. Graph Theory. 5 (1981) 323–331
R. M. Karp. Reducibility among combinatorial problems. Plenum Press, New York, 1972
D. Kratsch and L. Stewart. Domination on cocomparability graphs. SIAM J. Disc. Math. 6 (1993), 400–417
H. Müller and F. Nicolai. Polynomial time algorithms for Hamiltonian problems on bipartite distance-hereditary graphs. Inform. Process. Lett. 46 (1993) 225–230
F. Nicolai. Hamiltonian problems on distance-hereditary graphs. Technical Report. SM-DU-264 (1994). University of Duisburg
C. Papadimitrious and M. Yannakakis. Optimization, approximation and complexity classes. Journal of Computer and System Science. (1991) 425–440
H. G. Yeh and G. J. Chang. Weighted connected domination and Steiner trees in distance-hereditary graphs. Submitted
H. G. Yeh and G. J. Chang. Linear-time algorithms for bipartite distance-hereditary graphs. Submitted
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chang, MS., Hsieh, Sy., Chen, GH. (1997). Dynamic programming on distance-hereditary graphs. In: Leong, H.W., Imai, H., Jain, S. (eds) Algorithms and Computation. ISAAC 1997. Lecture Notes in Computer Science, vol 1350. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63890-3_37
Download citation
DOI: https://doi.org/10.1007/3-540-63890-3_37
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63890-2
Online ISBN: 978-3-540-69662-9
eBook Packages: Springer Book Archive