Pages that link to "Item:Q418726"
From MaRDI portal
The following pages link to The connected \(p\)-center problem on block graphs with forbidden vertices (Q418726):
Displaying 15 items.
- The connected \(p\)-median problem on block graphs (Q315481) (← links)
- The general facility location problem with connectivity on trees (Q335115) (← links)
- Algorithms for connected \(p\)-centdian problem on block graphs (Q724753) (← 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)
- The connected \(p\)-center problem on cactus graphs (Q1630992) (← 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)
- Approximability results for the converse connected<i>p</i>-centre problem<sup>†</sup> (Q2958261) (← links)
- The Connected p-Center Problem on Cactus Graphs (Q2958359) (← links)
- The Connected p-Centdian Problem on Block Graphs (Q3467867) (← links)
- The 1-Center Problem: Exploiting Block Structure (Q3818093) (← links)
- (Q5422574) (← links)
- The connected p-median problem on complete multi-layered graphs (Q5866016) (← links)
- A note proving the nullity of block graphs is unbounded (Q6646411) (← links)