| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428208 | Information Processing Letters | 2008 | 7 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
