Limin Hu
IEEE/ACM Transactions on Networking
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.
Limin Hu
IEEE/ACM Transactions on Networking
Michael C. McCord, Violetta Cavalli-Sforza
ACL 2007
David S. Kung
DAC 1998
A. Gupta, R. Gross, et al.
SPIE Advances in Semiconductors and Superconductors 1990