The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Journal of the ACM (JACM)
A Backtrack Procedure for Isomorphism of Directed Graphs
Journal of the ACM (JACM)
Design of a separable transition-diagram compiler
Communications of the ACM
A collection of graph analysis APL functions
APL '72 Proceedings of the fourth international conference on APL
An efficient planarity algorithm
An efficient planarity algorithm
| Hi-index | 0.00 |
An APL-based system for describing and manipulating sets of edge-labeled directed graphs is described. An associative naming system allows the user to label structures and elements of those structures with names of his own choosing. Provision is made for mathematically attaching to both edges and vertices information which can later be given semantic interpretation by user supplied algorithms. The approach allows application to a wide variety of areas of investigation where an experimental testbed for exploring new techniques is important. Examples of such areas include study of the relation between choice of representation and algorithmic efficiency for graph processing, directed graph representation of programs with edge labels representing control transfers, scene analysis techniques in artificial intelligence, and transition-diagram networks (C0N63).