Pages that link to "Item:Q2867088"

The following pages link to Hardness of r-dominating set on Graphs of Diameter (r + 1) (Q2867088):

Displaying 11 items.

• The \(k\)-hop connected dominating set problem: approximation and hardness (Q1679503) (← links)
• The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs (Q1756342) (← links)
• Revising Johnson's table for the 21st century (Q2091799) (← links)
• Coloring a dominating set without conflicts: \(q\)-subset square coloring (Q2097209) (← links)
• Complexity and inapproximability results for balanced connected subgraph problem (Q2232593) (← links)
• Structural parameters, tight bounds, and approximation for \((k, r)\)-center (Q2422740) (← links)
• On 2-clubs in graph-based data clustering: theory and algorithm engineering (Q2692726) (← links)
• On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering (Q5084692) (← links)
• (Q5136270) (← links)
• Colouring a dominating set without conflicts: \(q\)-subset square colouring (Q6077071) (← links)
• The parameterized complexity of terminal monitoring set (Q6575382) (← links)