Pages that link to "Item:Q2346962"
From MaRDI portal
The following pages link to Balanced partitions of trees and applications (Q2346962):
Displaying 24 items.
- Approximating minimum \(k\)-section in trees with linear diameter (Q324723) (← links)
- Unbalanced graph partitioning (Q372961) (← links)
- Fast balanced partitioning is hard even on grids and trees (Q388790) (← links)
- Intervals of balanced binary trees in the Tamari lattice (Q764359) (← links)
- Balanced graph partitioning (Q863200) (← links)
- Most balanced minimum cuts (Q968139) (← links)
- Approximation algorithms for minimum tree partition (Q1270776) (← links)
- Structural and algorithmic properties of 2-community structures (Q1635716) (← links)
- A shifting algorithm for continuous tree partitioning (Q1850820) (← links)
- On finding connected balanced partitions of trees (Q2028065) (← links)
- Learning directed acyclic graph SPNs in sub-quadratic time (Q2310290) (← links)
- On the uniform edge-partition of a tree (Q2370420) (← links)
- The shortest connection game (Q2403801) (← links)
- Balanced tree partition problems with virtual nodes (Q2424724) (← links)
- Finding well-balanced pairs of edge-disjoint trees in edge-weighted graphs (Q2427693) (← links)
- Cardinality constrained connected balanced partitions of trees under different criteria (Q2684048) (← links)
- Balanced partitions of trees and applications (Q2904753) (← links)
- New Insight into 2-Community Structures in Graphs with Applications in Social Networks (Q3467849) (← links)
- Approximation Algorithms for Min–Max Tree Partition (Q4360130) (← links)
- Partitioning of biweighted trees (Q4533449) (← links)
- Improved approximation algorithms for balanced partitioning problems (Q4601910) (← links)
- Dynamic Balanced Graph Partitioning (Q5130579) (← links)
- Minmax tree cover in the Euclidean space (Q5891341) (← links)
- The complexity of tree partitioning (Q5918926) (← links)
