On finding connected balanced partitions of trees
From MaRDI portal
Publication:2028065
DOI10.1016/J.DAM.2021.04.002zbMATH Open1469.90120OpenAlexW3157697337MaRDI QIDQ2028065FDOQ2028065
Authors: Maurizio Bruglieri, Isabella Lari, Federica Ricca, Andrea Scozzari, Roberto Cordone 
Publication date: 31 May 2021
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2434/849661
Recommendations
- Cardinality constrained connected balanced partitions of trees under different criteria
- Approximating the Maximally Balanced Connected Partition Problem in graphs
- Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size
- Balanced partitions of trees and applications
- Partitioning a Weighted Tree to Subtrees of Almost Uniform Size
Cites Work
- Partitioning a graph into minimum gap components
- Clustering on trees
- Partitioning a graph into connected components with fixed centers and optimizing cost-based objective functions or equipartition criteria
- Algorithms for uniform centered partitions of trees
- Polynomial algorithms for partitioning a tree into single‐center subtrees to minimize flat service costs
- Integrated versus hierarchical approach for zone delineation and crop planning under uncertainty
- Computing sharp bounds for hard clustering problems on trees
- Selection in \(X+Y\) and matrices with sorted rows and columns
- Title not available (Why is that?)
- Uniform and most uniform partitions of trees
- Algorithms and complexity of range clustering
Cited In (17)
- Optimal partition of a tree with social distance
- Partitioning a graph into connected components with fixed centers and optimizing cost-based objective functions or equipartition criteria
- Cardinality constrained connected balanced partitions of trees under different criteria
- Uniform and most uniform partitions of trees
- Balanced partitions of trees and applications
- Connected graph partitioning with aggregated and non‐aggregated gap objective functions
- Graph-Theoretic Concepts in Computer Science
- On the complexity of graph tree partition problems.
- Efficient algorithms for a graph partitioning problem
- Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size
- Balanced connected partitioning of unweighted grid graphs
- Algorithms for uniform centered partitions of trees
- Partitioning of biweighted trees
- Generating all patterns of graph partitions within a disparity bound
- Balanced tree partition problems with virtual nodes
- Finding well-balanced pairs of edge-disjoint trees in edge-weighted graphs
- Balanced partitions of trees and applications
This page was built for publication: On finding connected balanced partitions of trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2028065)
