Pages that link to "Item:Q1756346"
From MaRDI portal
The following pages link to Uniform and most uniform partitions of trees (Q1756346):
Displaying 7 items.
- Algorithms for uniform centered partitions of trees (Q510918) (← links)
- Path equipartition in the Chebyshev norm (Q1569949) (← links)
- On finding connected balanced partitions of trees (Q2028065) (← links)
- Branching structure of uniform recursive trees (Q2496384) (← links)
- Finding the seed of uniform attachment trees (Q2631843) (← links)
- Connected graph partitioning with aggregated and non‐aggregated gap objective functions (Q6180037) (← links)
- On the complexity of the upgrading version of the maximal covering location problem (Q6541022) (← links)