Enumerating minimal connected dominating sets
From MaRDI portal
Cites work
- A complexity theory for hard enumeration problems
- A faster algorithm for dominating set analyzed by the potential method
- A measure \& conquer approach for the analysis of exact algorithms
- A note on the complexity of the chromatic number problem
- An exact algorithm for connected red-blue dominating set
- Below all subsets for minimal connected dominating set
- Combinatorial bounds via measure and conquer
- Efficiently enumerating hitting sets of hypergraphs arising in data profiling
- Enumerating minimal connected dominating sets in graphs of bounded chordality
- Enumeration of minimal connected dominating sets for chordal graphs
- Exact exponential algorithms.
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- Identifying the Minimal Transversals of a Hypergraph and Related Problems
- Inclusion/exclusion meets measure and conquer
- Lower bounds based on the exponential time hypothesis
- Minimal dominating sets in graph classes: combinatorial bounds and enumeration
- Minimal dominating sets in interval graphs and trees
- On cliques in graphs
- On product covering in 3-tier supply chain models: natural complete problems for W[3] and W[4]
- On the complexity of solution extension of optimization problems
- On the enumeration of minimal dominating sets and related notions
- On the number of connected sets in bounded degree graphs
- On the number of minimal dominating sets on some graph classes
- Solving connected dominating set faster than \(2^n\)
- The complexity of dependency detection and discovery in relational databases
- The minimal hitting set generation problem: algorithms and computation
- Which problems have strongly exponential complexity?
Cited in
(4)
This page was built for publication: Enumerating minimal connected dominating sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6969690)
