Pages that link to "Item:Q4638584"
From MaRDI portal
The following pages link to Partitioning a graph into connected components with fixed centers and optimizing cost‐based objective functions or equipartition criteria (Q4638584):
Displaying 6 items.
- Algorithms for uniform centered partitions of trees (Q510918) (← links)
- Uniform and most uniform partitions of trees (Q1756346) (← links)
- On finding connected balanced partitions of trees (Q2028065) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- Metaheuristics for the minimum gap graph partitioning problem (Q2668747) (← links)
- Minmax centered \(k\)-partitioning of trees and applications to sink evacuation with dynamic confluent flows (Q6107888) (← links)
