Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko. Efficient Algorithms for the Hamiltonian Problem on Distance-Hereditary Graphs. In Oscar H. Ibarra, Louxin Zhang, editors, Computing and Combinatorics, 8th Annual International Conference, COCOON 2002, Singapore, August 15-17, 2002, Proceedings. Volume 2387 of Lecture Notes in Computer Science, pages 77-86, Springer, 2002. [doi]
@inproceedings{HsiehHHK02, title = {Efficient Algorithms for the Hamiltonian Problem on Distance-Hereditary Graphs}, author = {Sun-Yuan Hsieh and Chin-Wen Ho and Tsan-sheng Hsu and Ming-Tat Ko}, year = {2002}, url = {http://link.springer.de/link/service/series/0558/bibs/2387/23870077.htm}, tags = {graph-rewriting, rewriting}, researchr = {https://researchr.org/publication/HsiehHHK02}, cites = {0}, citedby = {0}, pages = {77-86}, booktitle = {Computing and Combinatorics, 8th Annual International Conference, COCOON 2002, Singapore, August 15-17, 2002, Proceedings}, editor = {Oscar H. Ibarra and Louxin Zhang}, volume = {2387}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {3-540-43996-X}, }