An exact exponential time algorithm for \textsc{Power} \textsc{Dominating} \textsc{Set} (Q2429350): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Approximation Algorithms and Hardness for Domination with Propagation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The PMU Placement Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Refined memorization for vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Algorithm for the Maximum Leaf Spanning Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact exponential algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3396567 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving connected dominating set faster than \(2^n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A measure & conquer approach for the analysis of exact algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Rectilinear Steiner Tree Problem is $NP$-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved algorithms and complexity results for power domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination in Graphs Applied to Electric Power Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized power domination complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power Domination in $\mathcal{O}^*(1.7548^n)$ Using Reference Search Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Amortized Search Tree Analysis for k-Leaf Spanning Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for maximum independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On feedback vertex sets and nonseparating independent sets in cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4910758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inclusion/Exclusion Meets Measure and Conquer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power domination in block graphs / rank
 
Normal rank

Revision as of 02:39, 5 July 2024

scientific article
Language Label Description Also known as
English
An exact exponential time algorithm for \textsc{Power} \textsc{Dominating} \textsc{Set}
scientific article

    Statements

    An exact exponential time algorithm for \textsc{Power} \textsc{Dominating} \textsc{Set} (English)
    0 references
    0 references
    0 references
    0 references
    26 April 2012
    0 references
    domination-type problems
    0 references
    moderately exponential time algorithms
    0 references
    NP-hardness results
    0 references
    measure and conquer
    0 references

    Identifiers