A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs - Université Clermont Auvergne Access content directly
Book Sections Year : 2016

A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs

Domains

Data Structures and Algorithms [cs.DS]

Vincent Limouzy  : Connect in order to contact the contributor

https://hal.uca.fr/hal-02082337

Submitted on : Thursday, March 28, 2019-11:02:25 AM

Last modification on : Saturday, April 22, 2023-4:24:55 AM

Consult the full text

Dates and versions

hal-02082337 , version 1 (28-03-2019)

Identifiers

Cite

Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno. A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs. WG 2015: Graph-Theoretic Concepts in Computer Science, pp.138-153, 2016, ⟨10.1007/978-3-662-53174-7_11⟩. ⟨hal-02082337⟩

Export

BibTeX TEI Dublin Core DC Terms EndNote Datacite

Collections

PRES_CLERMONT CNRS INRIA LIMOS INRIA2 CLERMONT-AUVERGNE-INP
60 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More