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

Autor:	Kant��, Mamadou Moustapha, Limouzy, Vincent, Mary, Arnaud, Nourine, Lhouari, Uno, Takeaki
Jazyk:	angličtina
Rok vydání:	2014
Předmět:	FOS: Computer and information sciences 68P05 68R10 05C69 05C85 05C30 Discrete Mathematics (cs.DM) Computer Science - Data Structures and Algorithms Data Structures and Algorithms (cs.DS) G.2.2 E.1 F.0 MathematicsofComputing_DISCRETEMATHEMATICS Computer Science - Discrete Mathematics
Popis:	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. 13 pages, 1 figure, submitted
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1fa05b3832397d6fdc4eba3443a3c6ca http://arxiv.org/abs/1407.2036 Zobrazit plný text záznamu