Showing papers on "Graph partition published in 1983"

TL;DR: In this paper, a divide-and-conquer framework for VLSI graph layout is introduced, which is used to design regular and configurable layouts, to assemble large networks of processor using restructurable chips, and to configure networks around faulty processors.

TL;DR: The vertex partitioning method using the 2-superline graph transform preceeding the squeeze tree search is so powerful that for all the graphs in the catalog it produces the automorphism partition, thereby making the tree search nothing more than a verification that the initial partition is indeed the autom Morphism partition.