Pages that link to "Item:Q2371802"
From MaRDI portal
The following pages link to Efficient algorithms for center problems in cactus networks (Q2371802):
Displayed 3 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)
- Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs (Q2347002) (← links)