An algorithm for partitioning trees augmented with sibling edges

Authors:
Rajesh Bordawekar;Oded Shmueli
Affiliations:
IBM T.J. Watson Research Center, Hawthorne, NY 10532, USA;Computer Science Department, Technion, Haifa 32000, Israel
Venue:
Information Processing Letters
Year:
2008

Citing 2
Cited 3

A linear time algorithm for optimal tree sibling partitioning and approximation algorithms in Natix

VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Efficient algorithm for the partitioning of trees

IBM Journal of Research and Development

PIXSAR: incremental reclustering of augmented XML trees

Proceedings of the 10th ACM workshop on Web information and data management
iPIXSAR: incremental clustering of indexed XML data

Proceedings of the 2009 EDBT/ICDT Workshops
A tight bound on the min-ratio edge-partitioning problem of a tree

Discrete Applied Mathematics

Quantified Score

Hi-index	0.89

Visualization

Abstract

We investigate 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 describe the algorithm, XS, and present a proof of its correctness.