Pages that link to "Item:Q414465"

The following pages link to Max-leaves spanning tree is APX-hard for cubic graphs (Q414465):

Displaying 8 items.

• Complexity of the maximum leaf spanning tree problem on planar and regular graphs (Q264582) (← links)
• The \(k\)-hop connected dominating set problem: hardness and polyhedra (Q324721) (← links)
• A 2-approximation algorithm for finding a spanning tree with maximum number of leaves (Q513269) (← links)
• Optimization of wireless sensor networks deployment with coverage and connectivity constraints (Q829179) (← links)
• The \(k\)-hop connected dominating set problem: approximation and hardness (Q1679503) (← links)
• Connected Domination (Q3384607) (← links)
• Robust Connectivity of Graphs on Surfaces (Q5084099) (← links)
• The complexity of spanning tree problems involving graphical indices (Q6202942) (← links)