Pages that link to "Item:Q987496"
From MaRDI portal
The following pages link to Domination in graphs with bounded propagation: Algorithms, formulations and hardness results (Q987496):
Displaying 25 items.
- Failed skew zero forcing on a graph (Q314747) (← links)
- Hybrid search for the optimal PMU placement problem on a power grid (Q319263) (← links)
- Generalized power domination of graphs (Q444434) (← links)
- Power domination on triangular grids with triangular and hexagonal shape (Q782760) (← links)
- Computational approaches for zero forcing and related problems (Q1631510) (← links)
- Note on power propagation time and lower bounds for the power domination number (Q1680484) (← links)
- Power domination in Knödel graphs and Hanoi graphs (Q1692626) (← links)
- Grundy dominating sequences and zero forcing sets (Q1751247) (← links)
- Power domination in circular-arc graphs (Q1939660) (← links)
- Disproofs of three conjectures on the power domination of graphs (Q2057589) (← links)
- Generalized power domination in claw-free regular graphs (Q2117535) (← links)
- Complexity of domination in triangulated plane graphs (Q2178742) (← links)
- Generalized power domination: propagation radius and Sierpiński graphs (Q2255613) (← links)
- A branch-and-cut algorithm for the maximum covering cycle problem (Q2288980) (← links)
- The \(k\)-power domination problem in weighted trees (Q2290632) (← links)
- Power domination throttling (Q2330105) (← links)
- Connected power domination in graphs (Q2424811) (← links)
- Reconfiguration graphs of zero forcing sets (Q2686137) (← links)
- On the Power Domination Number of Graph Products (Q2795962) (← links)
- Algorithms and Complexity of Power Domination in Graphs (Q3384121) (← links)
- Power Domination in Graphs (Q3384619) (← links)
- Improved Computational Approaches and Heuristics for Zero Forcing (Q5084604) (← links)
- Vertex sequences in graphs (Q5862692) (← links)
- New computational approaches for the power dominating set problem: Set covering and the neighborhoods of zero forcing forts (Q6065861) (← links)
- On the diameter and zero forcing number of some graph classes in the Johnson, Grassmann and Hamming association scheme (Q6124433) (← links)
