Journal Articles Theoretical Computer Science Year : 2019

Enumeration and maximum number of minimal dominating sets for chordal graphs

Domains

Automatic Data Structures and Algorithms [cs.DS]

Jérémie Schutz  : Connect in order to contact the contributor

https://hal.univ-lorraine.fr/hal-03242334

Submitted on : Monday, May 31, 2021-8:14:25 AM

Last modification on : Wednesday, October 30, 2024-6:17:21 PM

Consult the full text

Dates and versions

hal-03242334 , version 1 (31-05-2021)

Identifiers

Cite

Petr Golovach, Dieter Kratsch, Mathieu Liedloff, Mohamed Yosri Sayadi. Enumeration and maximum number of minimal dominating sets for chordal graphs. Theoretical Computer Science, 2019, 783, pp.41-52. ⟨10.1016/j.tcs.2019.03.017⟩. ⟨hal-03242334⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

UNIV-ORLEANS LGIPM UNIV-LORRAINE TDS-MACS INSA-GROUPE INSA-CVL ANR
53 View
0 Download

Altmetric

Share

More