Petr A. Golovach, Dieter Kratsch, Mathieu Liedloff, Mohamed Yosri Sayadi. Enumeration and Maximum Number of Maximal Irredundant Sets for Chordal Graphs. In Hans L. Bodlaender, Gerhard J. Woeginger, editors, Graph-Theoretic Concepts in Computer Science - 43rd International Workshop, WG 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers. Volume 10520 of Lecture Notes in Computer Science, pages 289-302, Springer, 2017. [doi]
@inproceedings{GolovachKLS17,
title = {Enumeration and Maximum Number of Maximal Irredundant Sets for Chordal Graphs},
author = {Petr A. Golovach and Dieter Kratsch and Mathieu Liedloff and Mohamed Yosri Sayadi},
year = {2017},
doi = {10.1007/978-3-319-68705-6_22},
url = {https://doi.org/10.1007/978-3-319-68705-6_22},
researchr = {https://researchr.org/publication/GolovachKLS17},
cites = {0},
citedby = {0},
pages = {289-302},
booktitle = {Graph-Theoretic Concepts in Computer Science - 43rd International Workshop, WG 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers},
editor = {Hans L. Bodlaender and Gerhard J. Woeginger},
volume = {10520},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-319-68705-6},
}