Pages that link to "Item:Q5492926"

The following pages link to Fundamentals of Computation Theory (Q5492926):

Displaying 24 items.

• Resolving-power dominating sets (Q299722) (← links)
• Generalized power domination of graphs (Q444434) (← links)
• Power domination in certain chemical structures (Q491607) (← links)
• On the power domination number of the generalized Petersen graphs (Q719033) (← links)
• Parameterized power domination complexity (Q844180) (← links)
• Experiments on data reduction for optimal domination in networks (Q863574) (← links)
• Improved algorithms and complexity results for power domination in graphs (Q958210) (← links)
• Domination in graphs with bounded propagation: Algorithms, formulations and hardness results (Q987496) (← links)
• Improved complexity for power edge set problem (Q1642691) (← links)
• More results on the complexity of domination problems in graphs (Q1664084) (← links)
• Complexity and inapproximability results for the power edge set problem (Q1743493) (← links)
• Disproofs of three conjectures on the power domination of graphs (Q2057589) (← links)
• Power domination in the generalized Petersen graphs (Q2175230) (← links)
• Power domination throttling (Q2330105) (← links)
• Augmenting weighted graphs to establish directed point-to-point connectivity (Q2359805) (← links)
• Connected power domination in graphs (Q2424811) (← links)
• An exact exponential time algorithm for \textsc{Power} \textsc{Dominating} \textsc{Set} (Q2429350) (← links)
• A cutting-plane algorithm for solving a weighted influence interdiction problem (Q2436687) (← links)
• Tree decompositions of graphs: saving memory in dynamic programming (Q2465936) (← links)
• Algorithms and Complexity of Power Domination in Graphs (Q3384121) (← links)
• Power domination number of sunlet graph and other graphs (Q5036755) (← links)
• Power domination in Mycielskian of spiders (Q5097786) (← links)
• (Q5173160) (← links)
• Hardness Results and Efficient Algorithms for Graph Powers (Q5851109) (← links)