Dominating Set Counting in Graph Classes

DOI10.1007/978-3-642-22685-4_2zbMath1348.68069OpenAlexW123842721MaRDI QIDQ3087935

Yoshio Okamoto, Shuji Kijima, Takeaki Uno

Publication date: 17 August 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22685-4_2

Mathematics Subject Classification ID

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

Related Items (7)

Approximately counting locally-optimal structures ⋮ Graph operations and neighborhood polynomials ⋮ Counting dominating sets in some subclasses of bipartite graphs ⋮ Counting independent dominating sets in linear polymers ⋮ Counting Minimal Dominating Sets ⋮ Counting dominating sets in generalized series-parallel graphs ⋮ Fast and simple algorithms for counting dominating sets in distance-hereditary graphs

This page was built for publication: Dominating Set Counting in Graph Classes