Affordable Access

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

Authors
  • Kanté, Mamadou Moustapha
  • Limouzy, Vincent
  • Mary, Arnaud
  • Nourine, Lhouari
  • Uno, Takeaki
Type
Preprint
Publication Date
Jul 08, 2014
Submission Date
Jul 08, 2014
Identifiers
arXiv ID: 1407.2036
Source
arXiv
License
Yellow
External links

Abstract

An output-polynomial algorithm for the listing of minimal dominating sets in graphs is a challenging open problem and is known to be equivalent to the well-known Transversal problem which asks for an output-polynomial algorithm for listing the set of minimal hitting sets in hypergraphs. We give a polynomial delay algorithm to list the set of minimal dominating sets in chordal graphs, an important and well-studied graph class where such an algorithm was open for a while.

Report this publication

Statistics

Seen <100 times