Power domination in circular-arc graphs (Q1939660): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Domination in graphs with bounded propagation: Algorithms, formulations and hardness results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms and Hardness for Domination with Propagation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3428640 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The PMU Placement Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power Domination in Product Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on power domination in grid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for a special case of disjoint set union / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / 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: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368729 / 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: Linear time algorithms on circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized power domination complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Cuts for Circular-Arc Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted power domination and fault-tolerant power domination on grids / 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: A unified approach to domination problems on interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency of a Good But Not Linear Set Union Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\) best cuts for circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power domination in block graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power domination in graphs / rank
 
Normal rank

Latest revision as of 05:31, 6 July 2024

scientific article
Language Label Description Also known as
English
Power domination in circular-arc graphs
scientific article

    Statements

    Power domination in circular-arc graphs (English)
    0 references
    0 references
    0 references
    0 references
    5 March 2013
    0 references
    domination
    0 references
    power domination
    0 references
    interval graphs
    0 references
    circular-arc graphs
    0 references

    Identifiers