Pages that link to "Item:Q2446334"

The following pages link to Algorithmic aspects of the \(k\)-domination problem in graphs (Q2446334):

Displaying 18 items.

• On the algorithmic complexity of \(k\)-tuple total domination (Q400524) (← links)
• Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs (Q501664) (← links)
• A linear time algorithm for optimal \(k\)-hop dominating set of a tree (Q894482) (← links)
• Multiple domination models for placement of electric vehicle charging stations in road networks (Q1652655) (← links)
• A generalized linear time algorithm for an optimal \(k\)-distance dominating set of a weighted tree (Q1679914) (← links)
• Complexity of \(k\)-rainbow independent domination and some results on the lexicographic product of graphs (Q2008916) (← links)
• A simple optimal algorithm for \(k\)-tuple dominating problem in interval graphs (Q2102897) (← links)
• A linear-time algorithm for minimum \(k\)-hop dominating set of a cactus graph (Q2166266) (← links)
• Distributed approximation algorithms for \(k\)-dominating set in graphs of bounded genus and linklessly embeddable graphs (Q2290639) (← links)
• New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs (Q2330102) (← links)
• Heuristics for \(k\)-domination models of facility location problems in street networks (Q2668796) (← links)
• Domination and convexity problems in the target set selection model (Q2689641) (← links)
• Multiple Domination (Q3384609) (← links)
• Tree-Like Structure Graphs with Full Diversity of Balls (Q4553642) (← links)
• The strong domination problem in block graphs and proper interval graphs (Q5207497) (← links)
• Enumeration of labeled block-cactus graphs (Q5264730) (← links)
• Computing maximum matchings in temporal graphs (Q6168321) (← links)
• Algorithmic study on 2-transitivity of graphs (Q6611052) (← links)