Alessio Conte, Mamadou Moustapha Kanté, Yota Otachi, Takeaki Uno, Kunihiro Wasa. Efficient Enumeration of Maximal k-Degenerate Subgraphs in a Chordal Graph. In Yixin Cao 0001, Jianer Chen, editors, Computing and Combinatorics - 23rd International Conference, COCOON 2017, Hong Kong, China, August 3-5, 2017, Proceedings. Volume 10392 of Lecture Notes in Computer Science, pages 150-161, Springer, 2017. [doi]
@inproceedings{ConteKOUW17,
title = {Efficient Enumeration of Maximal k-Degenerate Subgraphs in a Chordal Graph},
author = {Alessio Conte and Mamadou Moustapha Kanté and Yota Otachi and Takeaki Uno and Kunihiro Wasa},
year = {2017},
doi = {10.1007/978-3-319-62389-4_13},
url = {https://doi.org/10.1007/978-3-319-62389-4_13},
researchr = {https://researchr.org/publication/ConteKOUW17},
cites = {0},
citedby = {0},
pages = {150-161},
booktitle = {Computing and Combinatorics - 23rd International Conference, COCOON 2017, Hong Kong, China, August 3-5, 2017, Proceedings},
editor = {Yixin Cao 0001 and Jianer Chen},
volume = {10392},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-319-62389-4},
}