Partitioning of trees for minimizing height and cardinality

DOI10.1016/j.ipl.2003.11.004zbMath1176.68147OpenAlexW2082701944MaRDI QIDQ1029076

András Kovács, Tamás Kis

Publication date: 9 July 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2003.11.004

zbMATH Keywords

computational complexityanalysis of algorithmsgraph algorithmspartitioning of trees

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Clustering on trees
• The shifting algorithm technique for the partitioning of trees
• Tree partitioning under constraints. -- Clustering for vehicle routing problems
• A Linear Tree Partitioning Algorithm
• On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees

This page was built for publication: Partitioning of trees for minimizing height and cardinality