scientific article; zbMATH DE number 3866593

zbMATH Open0544.68046MaRDI QIDQ3334089FDOQ3334089

Authors: Stephen R. Schach, Ronald I. Becker 

Publication date: 1984

Title of this publication is not available (Why is that?)

Recommendations

• A bottom‐up algorithm for weight‐ and height‐bounded minimal partition of trees
• Approximation algorithms for minimum tree partition
• Minimum height path partitioning of trees
• Approximation Algorithms for Min–Max Tree Partition
• A tight bound on the min-ratio edge-partitioning problem of a tree
• A note on the minimum bounded edge-partition of a tree
• A shifting algorithm for constrained min-max partition on trees
• On minimum bisection and related partition problems in graphs with bounded tree width
• Min-cut partitioning on underlying tree and graph structures
• Partitioning graphs of bounded tree-width

zbMATH Keywords

partitionweightheightpolynomial time algorithmrooted tree

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Cited In (11)

• A shifting algorithm for constrained min-max partition on trees
• A note on the minimum bounded edge-partition of a tree
• Minimum height path partitioning of trees
• Divider-based algorithms for hierarchical tree partitioning.
• Edge separators for quasi-binary trees
• Title not available (Why is that?)
• A note on weighted rooted trees
• Partitioning a weighted tree into subtrees with weights in a given range
• A bottom‐up algorithm for weight‐ and height‐bounded minimal partition of trees
• Partitioning a Weighted Tree to Subtrees of Almost Uniform Size
• Efficient implementation of a shifting algorithm

This page was built for publication:

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