Pages that link to "Item:Q1270785"

The following pages link to Weighted connected domination and Steiner trees in distance-hereditary graphs (Q1270785):

Displaying 9 items.

• The \(k\)-hop connected dominating set problem: approximation and hardness (Q1679503) (← links)
• Paired-domination problem on distance-hereditary graphs (Q2006943) (← links)
• A linear-time algorithm for weighted paired-domination on block graphs (Q2168726) (← links)
• The \(k\)-power domination problem in weighted trees (Q2290632) (← links)
• The Hamiltonian problem on distance-hereditary graphs (Q2489947) (← links)
• Linear separation of connected dominating sets in graphs (Q5225055) (← links)
• Weighted connected \(k\)-domination and weighted \(k\)-dominating clique in distance-hereditary graphs (Q5941496) (← links)
• Domination in distance-hereditary graphs (Q5957300) (← links)
• Unique response Roman domination: complexity and algorithms (Q6088304) (← links)