Divide-and-conquer algorithms for graph-layout problems.

Ram Swaminathan Divide-and-conquer algorithms for graph-layout problems. 69-85 1996 28 Networks 2 http://dx.doi.org/10.1002/(SICI)1097-0037(199609)28:2<69::AID-NET1>3.0.CO;2-A db/journals/networks/networks28.html#Swaminathan96