Pages that link to "Item:Q2028065"
From MaRDI portal
The following pages link to On finding connected balanced partitions of trees (Q2028065):
Displaying 15 items.
- Algorithms for uniform centered partitions of trees (Q510918) (← links)
- Approximating the Maximally Balanced Connected Partition Problem in graphs (Q673224) (← links)
- Efficient algorithms for a graph partitioning problem (Q777267) (← links)
- On the complexity of graph tree partition problems. (Q1421460) (← links)
- Uniform and most uniform partitions of trees (Q1756346) (← links)
- Balanced partitions of trees and applications (Q2346962) (← links)
- Balanced tree partition problems with virtual nodes (Q2424724) (← links)
- Finding well-balanced pairs of edge-disjoint trees in edge-weighted graphs (Q2427693) (← links)
- Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size (Q2466001) (← links)
- Cardinality constrained connected balanced partitions of trees under different criteria (Q2684048) (← links)
- Balanced partitions of trees and applications (Q2904753) (← links)
- Partitioning of biweighted trees (Q4533449) (← links)
- Balanced Connected Partitioning of Unweighted Grid Graphs (Q5005141) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5710818) (← links)
- Connected graph partitioning with aggregated and non‐aggregated gap objective functions (Q6180037) (← links)
