An algorithm for partitioning trees augmented with sibling edges

4Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

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. © 2008 Elsevier B.V. All rights reserved.

Cite

CITATION STYLE

APA

Bordawekar, R., & Shmueli, O. (2008). An algorithm for partitioning trees augmented with sibling edges. Information Processing Letters, 108(3), 136–142. https://doi.org/10.1016/j.ipl.2008.04.010

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free