Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs

Abstract : It was proved independently and with different techniques in [Golovach et al. - ICALP 2013] and [Kanté et al. - ISAAC 2012] that there exists an incremental output polynomial algorithm for the enumeration of the minimal edge dominating sets in graphs, i.e., minimal dominating sets in line graphs. We provide the first polynomial delay and polynomial space algorithm for the problem. We propose a new technique to enlarge the applicability of Berge’s algorithm that is based on skipping hard parts of the enumeration by introducing a new search strategy. The new search strategy is given by a strong use of the structure of line graphs.
Document type :
Conference papers
Complete list of metadatas

Cited literature [27 references]  Display  Hide  Download

https://hal.inria.fr/hal-01248851
Contributor : Marie-France Sagot <>
Submitted on : Tuesday, May 23, 2017 - 10:33:36 AM
Last modification on : Thursday, April 18, 2019 - 3:20:05 PM

Links full text

Identifiers

  • HAL Id : hal-01248851, version 1
  • ARXIV : 1404.3501

Citation

Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno. Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs. Algorithms and Data Structures (WADS), Aug 2015, Victoria, Canada. pp.446-457. ⟨hal-01248851⟩

Share

Metrics

Record views

281