Pages that link to "Item:Q2371802"

The following pages link to Efficient algorithms for center problems in cactus networks (Q2371802):

Displaying 5 items.

• The connected \(p\)-center problem on block graphs with forbidden vertices (Q418726) (← links)
• Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks (Q496433) (← links)
• An optimal algorithm for the weighted backup 2-center problem on a tree (Q513273) (← links)
• Fast approximation of eccentricities and distances in hyperbolic graphs (Q4968378) (← links)
• (Q5091199) (← links)