Minimum height path partitioning of trees

MaRDI QIDQ555536zbMATH OpenFDO

Authors Alireza Bagheri, Mohammadreza Razzazi

Publication date 25 July 2011

Published in Scientia Iranica. Transactions D: Computer Science \& Engineering, Electrical Engineering (Search for Journal in Brave)

zbMATH Keywords

graph partitioningminimum height path partitioningpath partitioning

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• \(k\)-path partitions in trees
• scientific article; zbMATH DE number 3866593
• A shifting algorithm for constrained min-max partition on trees
• A bottom‐up algorithm for weight‐ and height‐bounded minimal partition of trees
• Path partition for graphs with special blocks

Cited in

(9)

• \(k\)-path partitions in trees
• Optimal point-set embedding of wheel graphs and a sub-class of 3-trees
• Minimum partition of an \(r\)-independence system
• scientific article; zbMATH DE number 3866593 (Why is no real title available?)
• A bottom‐up algorithm for weight‐ and height‐bounded minimal partition of trees
• Path Minima in Incremental Unrooted Trees
• Sum-of-max chain partition of a tree
• A linear-time approximation algorithm for the minimum-length geometric embedding of trees
• An algorithm for partitioning trees augmented with sibling edges

This page was built for publication: Minimum height path partitioning of trees

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