Pages that link to "Item:Q724753"

The following pages link to Algorithms for connected \(p\)-centdian problem on block graphs (Q724753):

Displaying 12 items.

• The connected \(p\)-median problem on block graphs (Q315481) (← links)
• The backup 2-median problem on block graphs (Q403496) (← links)
• The connected \(p\)-center problem on block graphs with forbidden vertices (Q418726) (← links)
• The \(p\)-maxian problem on block graphs (Q711397) (← links)
• The inverse connected \(p\)-median problem on block graphs under various cost functions (Q827099) (← links)
• A linear time algorithm for the \(p\)-maxian problem on trees with distance constraint (Q830937) (← links)
• A faster diameter problem algorithm for a chordal graph, with a connection to its center problem (Q2659238) (← links)
• A linear time algorithm for connected \(p\)-centdian problem on block graphs (Q2672632) (← links)
• An unweighted 1-center problem on block graphs (Q2887128) (← links)
• Block-vertex duality and the one-median problem (Q3792460) (← links)
• The connected p-median problem on complete multi-layered graphs (Q5866016) (← links)
• The uniform cost reverse 1-centdian location problem on tree networks with edge length reduction (Q6159691) (← links)