Exponential time algorithms for the minimum dominating set problem on some graph classes

DOI10.1145/1644015.1644024zbMath1300.05300OpenAlexW2025756084MaRDI QIDQ2930282

No author found.

Publication date: 18 November 2014

Published in: (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1644015.1644024

zbMATH Keywords

No records found.

Mathematics Subject Classification ID

No records found.

Related Items (9)

A polynomial-time approximation to a minimum dominating set in a graph ⋮ Parameterized and exact algorithms for class domination coloring ⋮ Large Induced Subgraphs via Triangulations and CMSO ⋮ Improved approximation for spanning star forest in dense graphs ⋮ Parameterized and Exact Algorithms for Class Domination Coloring ⋮ Parameterized domination in circle graphs ⋮ Inclusion/exclusion meets measure and conquer ⋮ Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity ⋮ Unnamed Item

This page was built for publication: Exponential time algorithms for the minimum dominating set problem on some graph classes