Raymond Wu, Jie Lu
ITA Conference 2007
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.
Raymond Wu, Jie Lu
ITA Conference 2007
Limin Hu
IEEE/ACM Transactions on Networking
Kafai Lai, Alan E. Rosenbluth, et al.
SPIE Advanced Lithography 2007
M.J. Slattery, Joan L. Mitchell
IBM J. Res. Dev