Yaw-Ling Lin, Fang-Rong Hsu, Yin-Te Tsai. Efficient Algorithms for the Minimum Connected Domination on Trapezoid Graphs. In Ding-Zhu Du, Peter Eades, Vladimir Estivill-Castro, Xuemin Lin, Arun Sharma, editors, Computing and Combinatorics, 6th Annual International Conference, COCOON 2000, Sydney, Australia, July 26-28, 2000, Proceedings. Volume 1858 of Lecture Notes in Computer Science, pages 126-136, Springer, 2000. [doi]
@inproceedings{LinHT00,
title = {Efficient Algorithms for the Minimum Connected Domination on Trapezoid Graphs},
author = {Yaw-Ling Lin and Fang-Rong Hsu and Yin-Te Tsai},
year = {2000},
url = {http://link.springer.de/link/service/series/0558/bibs/1858/18580126.htm},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/LinHT00},
cites = {0},
citedby = {0},
pages = {126-136},
booktitle = {Computing and Combinatorics, 6th Annual International Conference, COCOON 2000, Sydney, Australia, July 26-28, 2000, Proceedings},
editor = {Ding-Zhu Du and Peter Eades and Vladimir Estivill-Castro and Xuemin Lin and Arun Sharma},
volume = {1858},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-67787-9},
}