论文信息 - String processing algorithms for plant layout problems

String processing algorithms for plant layout problems

SUMMARY Difficulties in recognition of planarity of graphs in the context of layout problems are reviewed. A problem oriented linear string representation for trees and the concept of grammar are then introduced as basic tools for symbolic computation of trees and planar graphs. A heuristic method to solve the layout problem is next discussed and the need of optimal algorithmic techniques is pointed out. Finally the application of list processing techniques for manipulation by computer is suggested.

James M. Moore | Jouko J. Seppänen | James M. Moore | J. Seppänen

[1] J. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[2] O. Ore. Theory of Graphs , 1962 .

[3] C. Kuratowski. Sur le problème des courbes gauches en Topologie , 1930 .

[4] Milan Krejcirík. Computer-aided building layout , 1968, IFIP Congress.

[5] S. Lane. A structural characterization of planar combinatorial graphs , 1937 .

[6] Ugo Montanari,et al. Separable Graphs, Planar Graphs and Web Grammars , 1970, Inf. Control..

[7] L. Bittner. C. Berge, Théorie des graphes et ses applications. VIII + 277 S. m. 117 Abb. Paris 1958. Dunod Editeur. Preis geb. 3400 F , 1960 .

[8] H. Whitney. Non-Separable and Planar Graphs. , 1931, Proceedings of the National Academy of Sciences of the United States of America.

[9] W. Dunn,et al. An Algorithm for Testing the Planarity of a Graph , 1968 .

[10] Frank Harary,et al. Graph Theory , 2016 .

[11] Jouko J. Seppänen,et al. Facilities Planning with Graph Theory , 1970 .

[12] B. Whitehead,et al. The planning of single-storey layouts , 1965 .

[13] D. Koenig. Theorie Der Endlichen Und Unendlichen Graphen , 1965 .

[14] Kurt Ernst Weil. Plant layout and design , 1967 .

[15] Azriel Rosenfeld,et al. Web Grammars , 1969, IJCAI.

[16] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .

[17] O. Wing,et al. Computer Recognition and Extraction of Planar Graphs from the Incidence Matrix , 1966 .