Counting Minimum Weighted Dominating Sets

DOI10.1007/978-3-540-73545-8_18zbMATH Open1206.05074OpenAlexW1572075663MaRDI QIDQ3608842FDOQ3608842

Fedor V. Fomin, Alexey A. Stepanov

Publication date: 6 March 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-540-73545-8_18

Mathematics Subject Classification ID

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

Cited In (3)

• Bounds on the maximum number of minimum dominating sets
• Bicolored independent sets and bicliques
• Title not available (Why is that?)

   Recommendations

• Algorithms and Computation 👍 👎
• Inclusion/Exclusion Meets Measure and Conquer 👍 👎
• Combinatorial bounds via measure and conquer 👍 👎
• Counting Minimal Dominating Sets 👍 👎
• An O *(1.1939 n ) Time Algorithm for Minimum Weighted Dominating Induced Matching 👍 👎

This page was built for publication: Counting Minimum Weighted Dominating Sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608842)