Andreas Brandstädt, Christian Hundt, Ragnar Nevries. Efficient Edge Domination on Hole-Free Graphs in Polynomial Time. In Alejandro López-Ortiz, editor, LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings. Volume 6034 of Lecture Notes in Computer Science, pages 650-661, Springer, 2010. [doi]
@inproceedings{BrandstadtHN10,
title = {Efficient Edge Domination on Hole-Free Graphs in Polynomial Time},
author = {Andreas Brandstädt and Christian Hundt and Ragnar Nevries},
year = {2010},
doi = {10.1007/978-3-642-12200-2_56},
url = {http://dx.doi.org/10.1007/978-3-642-12200-2_56},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/BrandstadtHN10},
cites = {0},
citedby = {0},
pages = {650-661},
booktitle = {LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings},
editor = {Alejandro López-Ortiz},
volume = {6034},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-12199-9},
}