Power domination in circular-arc graphs

DOI10.1007/S00453-011-9599-XMaRDI QIDQ1939660zbMATH OpenOpenAlexFDO

Authors Chung-Shou Liao, Der-Tsai Lee

Publication date 5 March 2013

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-011-9599-x

zbMATH Keywords

circular-arc graphsdominationinterval graphspower domination

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Computing and Combinatorics
• Domination in Graphs Applied to Electric Power Networks
• Power domination in block graphs
• Algorithms and complexity of power domination in graphs
• Improved algorithms and complexity results for power domination in graphs

Cites work

• \(k\) best cuts for circular-arc graphs
• A linear-time algorithm for a special case of disjoint set union
• A note on power domination in grid graphs
• A unified approach to domination problems on interval graphs
• Approximation Algorithms and Hardness for Domination with Propagation
• Computing and Combinatorics
• Domination in Graphs Applied to Electric Power Networks
• Domination in graphs with bounded propagation: Algorithms, formulations and hardness results
• Efficiency of a Good But Not Linear Set Union Algorithm
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 5138348 (Why is no real title available?)
• scientific article; zbMATH DE number 1302196 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• Improved algorithms and complexity results for power domination in graphs
• Linear time algorithms on circular-arc graphs
• Minimum Cuts for Circular-Arc Graphs
• Parameterized power domination complexity
• Power Domination in $\mathcal{O}^*(1.7548^n)$ Using Reference Search Trees
• Power domination in block graphs
• Power domination in graphs
• Power Domination in Product Graphs
• Restricted power domination and fault-tolerant power domination on grids
• The PMU Placement Problem

Cited in

(11)

• Power domination in the generalized Petersen graphs
• Generalized power domination: propagation radius and Sierpiński graphs
• New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs
• A linear-time algorithm for paired-domination on circular-arc graphs
• Algorithms and complexity of power domination in graphs
• Power domination in certain chemical structures
• Computing and Combinatorics
• Power domination with bounded time constraints
• \(k\)-power domination in block graphs
• New computational approaches for the power dominating set problem: Set covering and the neighborhoods of zero forcing forts
• An efficient algorithm for power dominating set

This page was built for publication: Power domination in circular-arc graphs

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