Minimal Dominating Sets in Graph Classes: Combinatorial Bounds and Enumeration - Archive ouverte HAL Access content directly
Book Sections Year : 2012

Dates and versions

hal-02332165 , version 1 (24-10-2019)

Identifiers

Cite

Jean-François Couturier, Pinar Heggernes, Pim Van’t Hof, Dieter Kratsch. Minimal Dominating Sets in Graph Classes: Combinatorial Bounds and Enumeration. SOFSEM 2012: Theory and Practice of Computer Science, pp.202-213, 2012, ⟨10.1007/978-3-642-27660-6_17⟩. ⟨hal-02332165⟩
21 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More