An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets

DOI10.1007/978-3-642-39206-1_41zbMath1336.05133arXiv1208.5345OpenAlexW187414392MaRDI QIDQ5326585

Yngve Villanger, Petr A. Golovach, Dieter Kratsch, Pinar Heggernes

Publication date: 6 August 2013

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1208.5345

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (3)

Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs ⋮ Minimal dominating sets in interval graphs and trees ⋮ An incremental polynomial time algorithm to enumerate all minimal edge dominating sets

This page was built for publication: An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets