A Linear Tree Partitioning Algorithm
From MaRDI portal
Cited in
(23)- An overview of graph covering and partitioning
- On the maximum parsimony distance between phylogenetic trees
- On a labeling problem in graphs
- Partitioning trees: Matching, domination, and maximum diameter
- A linear algorithm for the Hamiltonian completion number of a tree
- Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations
- Cardinality constrained connected balanced partitions of trees under different criteria
- A tight bound on the min-ratio edge-partitioning problem of a tree
- Tree edge decomposition with an application to minimum ultrametric tree approximation
- An algorithm for partitioning trees augmented with sibling edges
- Partitioning a weighted tree into subtrees with weights in a given range
- Partitioning of trees for minimizing height and cardinality
- Complexity of constrained sensor placement problems for optimal observability
- Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size
- On a 2-dimensional equipartition problem
- A bottom‐up algorithm for weight‐ and height‐bounded minimal partition of trees
- A linear-time algorithm for finding an edge-partition with max-min ratio at most two
- Approximations to clustering and subgraph problems on trees
- Tree partitioning under constraints. -- Clustering for vehicle routing problems
- On the uniform edge-partition of a tree
- The even adjacency split problem for graphs
- Generating irregular partitionable data structures
- Efficient implementation of a shifting algorithm
This page was built for publication: A Linear Tree Partitioning Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4116058)
