Author:
Chang Maw-Shang,Hsieh Sun-yuan,Chen Gen-Huey
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. S. Arnborg, D. G. Corneil, and A. Proskurowski.: Complexity of finding embeddings in a k-tree. SIAM J. Alg. Disc. Math. (1987) 277–284
2. H. J. Bandelt, A. Henkmann, and F. Nicolai.: Powers of distance-hereditary graphs. Technical Report SM-DU-220 (1993), University of Duisburg
3. H. J. Bandelt and H. M. Mulder: Distance-hereditary graphs. J. Comb. Theory. Series B. 41 (1986) 182–208
4. A. Branstadt and F. F. Dragan.: A linear-time algorithm for connected r-domination and Steiner tree on distance-hereditary graphs. Preprint (1994)
5. G. J. Chang.: Private communication.
Cited by
35 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献