External labeling and algorithms for hierarchic networks
Algorithms for generating internal data structures for networks are given. Data bases for networks can be partitioned hierarchically. Nodes of lower class networks may also be in the interior of a higher class arc which will be split if it is included into the final network. Naming is based either on nodes or on arcs.
KeywordsHead Node Final Network Hierarchy Class Node Table Internal Data Structure
Unable to display preview. Download preview PDF.