Power domination with bounded time constraints (Q5963647): 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: Domination in graphs with bounded propagation: Algorithms, formulations and hardness results / 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: Spreading Messages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized power domination of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power Domination in Product Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Power Domination in Regular 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 threshold of ln <i>n</i> for approximating set cover / 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: A survey of gossiping and broadcasting in communication networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized power domination complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power domination in circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power domination number of the generalized Petersen graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact exponential time algorithm for \textsc{Power} \textsc{Dominating} \textsc{Set} / 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
Property / cites work
 
Property / cites work: Power domination in planar graphs with small diameter / rank
 
Normal rank

Latest revision as of 11:02, 11 July 2024

scientific article; zbMATH DE number 6544335
Language Label Description Also known as
English
Power domination with bounded time constraints
scientific article; zbMATH DE number 6544335

    Statements

    Power domination with bounded time constraints (English)
    0 references
    0 references
    23 February 2016
    0 references
    algorithm
    0 references
    domination
    0 references
    power domination
    0 references
    time constraint
    0 references

    Identifiers