An algorithm for partitioning trees augmented with sibling edges |
| |
| Authors: | Rajesh Bordawekar Oded Shmueli |
| |
| Affiliation: | a IBM T.J. Watson Research Center, Hawthorne, NY 10532, USA
b Computer Science Department, Technion, Haifa 32000, Israel |
| |
| 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. |
| |
| Keywords: | Algorithms Analysis of algorithms Graph algorithms |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
