Efficient Algorithm for the Partitioning of Trees

DOI10.1147/RD.183.0217MaRDI QIDQ4778261zbMATH OpenOpenAlexFDO

Authors J. A. Lukes

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

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to combinatorics (05-04) Trees (05C05) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to information and communication theory (94-04)

Cited in

(16)

• Approximations to clustering and subgraph problems on trees
• Pseudopolynomial algorithms for the solution of backpack problems
• Generating irregular partitionable data structures
• Reformulated acyclic partitioning for rail-rail containers transshipment
• Optimizing constrained subtrees of trees
• Balanced tree partition problems with virtual nodes
• Facet-defining inequalities for the simple graph partitioning polytope
• Best location of service centers in a treelike network under budget constraints
• A polyhedral study of lifted multicuts
• Separation algorithm for tree partitioning inequalities
• A branch-and-bound algorithm for the acyclic partitioning problem
• scientific article; zbMATH DE number 3770975 (Why is no real title available?)
• A strong formulation for the graph partition problem
• Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations
• On the complexity of partitioning sparse matrix representations
• Un algoritmo per il partizionamento ottimo di una nuova classe di grafi

This page was built for publication: Efficient Algorithm for the Partitioning of Trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4778261)