Efficient Algorithm for the Partitioning of Trees
DOI10.1147/RD.183.0217zbMATH Open0289.68008OpenAlexW2048383295MaRDI QIDQ4778261FDOQ4778261
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
Trees (05C05) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to information and communication theory (94-04) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Cited In (16)
- Facet-defining inequalities for the simple graph partitioning polytope
- Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations
- Reformulated acyclic partitioning for rail-rail containers transshipment
- Best location of service centers in a treelike network under budget constraints
- Optimizing constrained subtrees of trees
- Separation algorithm for tree partitioning inequalities
- A polyhedral study of lifted multicuts
- A branch-and-bound algorithm for the acyclic partitioning problem
- Pseudopolynomial algorithms for the solution of backpack problems
- Title not available (Why is that?)
- A strong formulation for the graph partition problem
- 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
- Generating irregular partitionable data structures
- Balanced tree partition problems with virtual nodes
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)
