No abstract

No abstract

No abstract

No abstract

One of the difficulties associated with the application ofgraph theory to the facilities layout problem is the conversion of the dual graph into a block layout. This paper presents a procedure to address this problem. The procedure exploits the similarities between the graph-theoretic approach and computerized layoutconstruction procedures, and also resolves some of their differences. It considers the faces of the dual graph one by one and places them in the block layout adjacent to each other in a manner consistent with the adjacencies specified by the dual graph. The procedure is independent.ofthe manner the maximal planar weighted graph is developed.