scientific article; zbMATH DE number 3866593
From MaRDI portal
Publication:3334089
Recommendations
- A bottom‐up algorithm for weight‐ and height‐bounded minimal partition of trees
- Approximation algorithms for minimum tree partition
- Minimum height path partitioning of trees
- Approximation Algorithms for Min–Max Tree Partition
- A tight bound on the min-ratio edge-partitioning problem of a tree
- A note on the minimum bounded edge-partition of a tree
- A shifting algorithm for constrained min-max partition on trees
- On minimum bisection and related partition problems in graphs with bounded tree width
- Min-cut partitioning on underlying tree and graph structures
- Partitioning graphs of bounded tree-width
Cited in
(11)- Partitioning a weighted tree into subtrees with weights in a given range
- Minimum height path partitioning of trees
- A note on weighted rooted trees
- Partitioning a Weighted Tree to Subtrees of Almost Uniform Size
- A bottom‐up algorithm for weight‐ and height‐bounded minimal partition of trees
- scientific article; zbMATH DE number 2075844 (Why is no real title available?)
- Divider-based algorithms for hierarchical tree partitioning.
- A shifting algorithm for constrained min-max partition on trees
- A note on the minimum bounded edge-partition of a tree
- Efficient implementation of a shifting algorithm
- Edge separators for quasi-binary trees
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3334089)
