An algorithm for partitioning trees augmented with sibling edges

DOI10.1016/J.IPL.2008.04.010zbMATH Open1191.68893OpenAlexW2035890212MaRDI QIDQ975430FDOQ975430

Authors: Rajesh Bordawekar, Oded Shmueli 

Publication date: 9 June 2010

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

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

Recommendations

• scientific article; zbMATH DE number 3970117
• Minimum height path partitioning of trees
• scientific article; zbMATH DE number 672025
• The shifting algorithm technique for the partitioning of trees
• scientific article; zbMATH DE number 4108779

zbMATH Keywords

algorithmsanalysis of algorithmsgraph algorithms

Mathematics Subject Classification ID

Analysis of algorithms (68W40)

Cites Work

• Title not available (Why is that?)
• A Linear Tree Partitioning Algorithm
• Parallel concepts in graph theory
• A model for the evaluation of storage hierarchies

Cited In (2)

• Title not available (Why is that?)
• A tight bound on the min-ratio edge-partitioning problem of a tree

This page was built for publication: An algorithm for partitioning trees augmented with sibling edges

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