A frame architecture for a certain class of graph search problems
Bon K. Sy, J.R. Deller · IEEE Transactions on Systems Man and Cybernetics · 1988
A frame control strategy is presented which directs an efficient graph search when information available for finding a path is distributed throughout the graph. The frame structure requires (worst case) only O(K/sup N/) memory size instead of O(K/sup 2N/), which is needed for a matrix representation of an N-level, K-branch tree graph. An efficiency analysis is detailed, and its application to a communication system for the nonverbal, severely motor disabled is discussed.>