String processing algorithms for plant layout problems

1 January 1975

journal article
research article
Published by Taylor & Francis in International Journal of Production Research

Vol. 13 (3), 239-254
https://doi.org/10.1080/00207547508942994

Abstract

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.

Keywords

This publication has 10 references indexed in Scilit:

Facilities Planning with Graph Theory
Management Science, 1970
GRAPH THEORY
Published by Defense Technical Information Center (DTIC) ,1969
SEPARABLE GRAPHS, PLANAR GRAPHS AND WEB GRAMMARS
Published by Defense Technical Information Center (DTIC) ,1969
An Algorithm for Testing the Planarity of a Graph
IEEE Transactions on Circuit Theory, 1968
Computer Recognition and Extraction of Planar Graphs from the Incidence Matrix
IEEE Transactions on Circuit Theory, 1966
Theory of Graphs
Published by American Mathematical Society (AMS) ,1962
On the shortest spanning subtree of a graph and the traveling salesman problem
Proceedings of the American Mathematical Society, 1956
A structural characterization of planar combinatorial graphs
Duke Mathematical Journal, 1937
Non-separable and planar graphs
Transactions of the American Mathematical Society, 1932
Sur le problème des courbes gauches en Topologie
Fundamenta Mathematicae, 1930

Cited by 16 articles