H. S. Chao, Fang-Rong Hsu, Richard C. T. Lee. An Optimal Algorithm for Finding the Minimum Cardinality Dominating Set on Permutation Graphs. In Wen-Lian Hsu, Ming-Yang Kao, editors, Computing and Combinatorics, 4th Annual International Conference, COCOON 98, Taipei, Taiwan, R.o.C., August 12-14, 1998, Proceedings. Volume 1449 of Lecture Notes in Computer Science, pages 309-318, Springer, 1998. [doi]
@inproceedings{ChaoHL98,
title = {An Optimal Algorithm for Finding the Minimum Cardinality Dominating Set on Permutation Graphs},
author = {H. S. Chao and Fang-Rong Hsu and Richard C. T. Lee},
year = {1998},
url = {http://link.springer.de/link/service/series/0558/bibs/1449/14490309.htm},
tags = {graph-rewriting, C++, rewriting},
researchr = {https://researchr.org/publication/ChaoHL98},
cites = {0},
citedby = {0},
pages = {309-318},
booktitle = {Computing and Combinatorics, 4th Annual International Conference, COCOON 98, Taipei, Taiwan, R.o.C., August 12-14, 1998, Proceedings},
editor = {Wen-Lian Hsu and Ming-Yang Kao},
volume = {1449},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-64824-0},
}