论文信息 - An algorithm for partitioning trees augmented with sibling edges

An algorithm for partitioning trees augmented with sibling edges

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.

Oded Shmueli | Rajesh Bordawekar

[1] Frank Harary,et al. Graph Theory , 2016 .

[2] Sukhamay Kundu,et al. A Linear Tree Partitioning Algorithm , 1977, SIAM J. Comput..

[3] Joseph A. Lukes. Efficient Algorithm for the Partitioning of Trees , 1974, IBM J. Res. Dev..

[4] Guido Moerkotte,et al. A linear time algorithm for optimal tree sibling partitioning and approximation algorithms in Natix , 2006, VLDB.