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.
No takes yet. Share an insight, caveat, or question.
Seppänen et al. (1975) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: