A Linear Tree Partitioning Algorithm
From MaRDI portal
Publication:4116058
DOI10.1137/0206012zbMath0346.68020OpenAlexW2053400346MaRDI QIDQ4116058
Publication date: 1977
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0206012
Related Items
Tree edge decomposition with an application to minimum ultrametric tree approximation, On the uniform edge-partition of a tree, An overview of graph covering and partitioning, Complexity of constrained sensor placement problems for optimal observability, A tight bound on the min-ratio edge-partitioning problem of a tree, Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations, Cardinality constrained connected balanced partitions of trees under different criteria, Partitioning a weighted tree into subtrees with weights in a given range, A linear-time algorithm for finding an edge-partition with max-min ratio at most two, Tree partitioning under constraints. -- Clustering for vehicle routing problems, Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size, On a labeling problem in graphs, An algorithm for partitioning trees augmented with sibling edges, A bottom‐up algorithm for weight‐ and height‐bounded minimal partition of trees, A linear algorithm for the Hamiltonian completion number of a tree, On a 2-dimensional equipartition problem, Partitioning of trees for minimizing height and cardinality, The even adjacency split problem for graphs, Partitioning trees: Matching, domination, and maximum diameter, Generating irregular partitionable data structures, Approximations to clustering and subgraph problems on trees, Efficient implementation of a shifting algorithm, On the maximum parsimony distance between phylogenetic trees
