Efficient Algorithm for the Partitioning of Trees
From MaRDI portal
Publication:4778261
DOI10.1147/rd.183.0217zbMath0289.68008OpenAlexW2048383295MaRDI QIDQ4778261
Publication date: 1974
Published in: IBM Journal of Research and Development (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/325709b0fc091cbebfa53bb32cc1c09143b25ba2
Trees (05C05) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to combinatorics (05-04) Software, source code, etc. for problems pertaining to information and communication theory (94-04)
Related Items
Separation algorithm for tree partitioning inequalities, Best location of service centers in a treelike network under budget constraints, A branch-and-bound algorithm for the acyclic partitioning problem, Optimizing constrained subtrees of trees, A strong formulation for the graph partition problem, Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations, Balanced tree partition problems with virtual nodes, A polyhedral study of lifted multicuts, Reformulated acyclic partitioning for rail-rail containers transshipment, Facet-defining inequalities for the simple graph partitioning polytope, Unnamed Item, Generating irregular partitionable data structures, On the complexity of partitioning sparse matrix representations, Un algoritmo per il partizionamento ottimo di una nuova classe di grafi, Approximations to clustering and subgraph problems on trees, Pseudopolynomial algorithms for the solution of backpack problems
