Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Journal articles

Enumerating minimal connected dominating sets in graphs of bounded chordality

Document type :
Journal articles
Complete list of metadata

https://hal.univ-lorraine.fr/hal-03242349
Contributor : Jérémie Schutz Connect in order to contact the contributor
Submitted on : Monday, May 31, 2021 - 8:35:24 AM
Last modification on : Wednesday, April 6, 2022 - 8:54:04 PM

Links full text

Identifiers

Collections

Citation

Petr Golovach, Pinar Heggernes, Dieter Kratsch. Enumerating minimal connected dominating sets in graphs of bounded chordality. Theoretical Computer Science, Elsevier, 2016, 630, pp.63-75. ⟨10.1016/j.tcs.2016.03.026⟩. ⟨hal-03242349⟩

Share

Metrics

Record views

12