An Algorithm for Partitioning Trees Augmented with Sibling Edges

We inventigate a special case of the graph partitioning problem: the partitioning of a sibling graph which is an ordered tree augmented with edges connecting consecutive nodes that share a common parent. We present XS, a dynamic programming algorithm for partitioning an n-node sibling graph in
O (nW3) time and O (nW + W2) space. We describe the algorithm and present a proof of its correctness.

By: Rajesh Bordawekar; Oded Shmueli

Published in: RC23979 in 2006


This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.


Questions about this service can be mailed to .