Journal Articles
Theoretical Computer Science
Year : 2016
Jérémie Schutz : Connect in order to contact the contributor
https://hal.univ-lorraine.fr/hal-03242349
Submitted on : Monday, May 31, 2021-8:35:24 AM
Last modification on : Tuesday, September 3, 2024-1:56:20 PM
Cite
Petr Golovach, Pinar Heggernes, Dieter Kratsch. Enumerating minimal connected dominating sets in graphs of bounded chordality. Theoretical Computer Science, 2016, 630, pp.63-75. ⟨10.1016/j.tcs.2016.03.026⟩. ⟨hal-03242349⟩
Collections
15
View
0
Download