Pages that link to "Item:Q1029052"

The following pages link to Hardness results and approximation algorithms of \(k\)-tuple domination in graphs (Q1029052):

Displaying 38 items.

• On the \((h,k)\)-domination numbers of iterated line digraphs (Q444453) (← links)
• Algorithmic aspects of \(k\)-tuple total domination in graphs (Q456136) (← links)
• Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs (Q501664) (← links)
• On the \(k\)-tuple domination of generalized de Brujin and Kautz digraphs (Q621581) (← links)
• \(k\)-domination and \(k\)-independence in graphs: A survey (Q659765) (← links)
• A polyhedral view to a generalization of multiple domination (Q832985) (← links)
• Upper bounds for \(\alpha \)-domination parameters (Q844230) (← links)
• The upper bound on \(k\)-tuple domination numbers of graphs (Q925036) (← links)
• The \(k\)-tuple domination number revisited (Q952712) (← links)
• Algorithms for minimum \(m\)-connected \(k\)-tuple dominating set problem (Q995580) (← links)
• The \(k\)-tuple twin domination in de Bruijn and Kautz digraphs (Q998382) (← links)
• Connected \(k\)-tuple twin domination in de Bruijn and Kautz digraphs (Q1045016) (← links)
• Domination parameters with number 2: interrelations and algorithmic consequences (Q1682877) (← links)
• The complexity of secure domination problem in graphs (Q1708386) (← links)
• Algorithmic aspects of semitotal domination in graphs (Q1731849) (← links)
• Hardness results and approximation algorithm for total liar's domination in graphs (Q2015803) (← links)
• Algorithmic aspects of 2-secure domination in graphs (Q2045038) (← links)
• Double vertex-edge domination in graphs: complexity and algorithms (Q2053214) (← links)
• Liar's dominating set problem on unit disk graphs (Q2201773) (← links)
• Global total \(k\)-domination: approximation and hardness results (Q2216425) (← links)
• Constant thresholds can make target set selection tractable (Q2254488) (← links)
• Hardness results, approximation and exact algorithms for liar's domination problem in graphs (Q2257297) (← links)
• Upper bounds for the domination numbers of graphs using Turán's theorem and Lovász local lemma (Q2334078) (← links)
• On the \(k\)-tuple domination of de Bruijn and Kautz digraphs (Q2380002) (← links)
• Rainbow domination and related problems on strongly chordal graphs (Q2446318) (← links)
• A generalised upper bound for the \(k\)-tuple domination number (Q2470457) (← links)
• Heuristics for \(k\)-domination models of facility location problems in street networks (Q2668796) (← links)
• Connected liar's domination in graphs: complexity and algorithms (Q2874035) (← links)
• Hardness, Approximability, and Exact Algorithms for Vector Domination and Total Vector Domination in Graphs (Q3088291) (← links)
• Bounds on the k-tuple domatic number of a graph (Q3096549) (← links)
• Multiple Domination (Q3384609) (← links)
• MATCHING PROPERTIES IN DOUBLE DOMINATION EDGE CRITICAL GRAPHS (Q3575371) (← links)
• Hardness Results for Seeding Complex Contagion with Neighborhoods (Q5050309) (← links)
• Complexity and algorithms for semipaired domination in graphs (Q5918285) (← links)
• Algorithmic aspects of paired disjunctive domination in graphs (Q6100186) (← links)
• Fault-tolerant total domination via submodular function approximation (Q6111966) (← links)
• On \(k\)-vertex-edge domination of graph (Q6146665) (← links)
• More on the complexity of defensive domination in graphs (Q6657275) (← links)