Divider-based algorithms for hierarchical tree partitioning.

DOI10.1016/S0166-218X(03)00443-8zbMath1035.05088OpenAlexW2053343528MaRDI QIDQ1427182

Rossella Petreschi, Irene Finocchi

Publication date: 14 March 2004

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(03)00443-8

zbMATH Keywords

TreesCentroidsGraph partitioning problemsHierarchical decompositions

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A shifting algorithm for constrained min-max partition on trees
• Approximations to clustering and subgraph problems on trees
• Efficient implementation of a shifting algorithm
• Planar graphs: Theory and algorithms
• Most uniform path partitioning and its use in image processing
• The shifting algorithm technique for the partitioning of trees
• Clustering in Trees: Optimizing Cluster Sizes and Number of Subtrees
• Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
• A Separator Theorem for Planar Graphs
• Max-Min Tree Partitioning
• The Profile Minimization Problem in Trees
• Bounds on Multiprocessing Timing Anomalies

This page was built for publication: Divider-based algorithms for hierarchical tree partitioning.