Enumeration and Maximum Number of Maximal Irredundant Sets for Chordal Graphs - Archive ouverte HAL Access content directly
Conference Papers Year : 2017
No file

Dates and versions

hal-01971051 , version 1 (06-01-2019)

Identifiers

  • HAL Id : hal-01971051 , version 1

Cite

Petr A. Golovach, Dieter Kratsch, Mathieu Liedloff, Mohamed Yosri Sayadi. Enumeration and Maximum Number of Maximal Irredundant Sets for Chordal Graphs. International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2017), Jun 2017, Eindhoven, Netherlands. pp.289-302. ⟨hal-01971051⟩
43 View
0 Download

Share

Gmail Facebook X LinkedIn More