Conference paper
Global routing revisited
Michael D. Moffitt
ICCAD 2009
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.
Michael D. Moffitt
ICCAD 2009
Israel Cidon, Leonidas Georgiadis, et al.
IEEE/ACM Transactions on Networking
Minkyong Kim, Zhen Liu, et al.
INFOCOM 2008
Inbal Ronen, Elad Shahar, et al.
SIGIR 2009