Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Ebert, J.: A versatile data structure for edge-oriented graph algorithms. Communications of the ACM 30 (1987) 513–519.
Kleindorfer, G.B., Kochenberger, G.A and Reutzel, E.T.: Computing inter-site distances for routing and scheduling problems. Operations Research Letters 1 (1981) 31–33.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Perko, A. (1988). External labeling and algorithms for hierarchic networks. In: Göttler, H., Schneider, HJ. (eds) Graph-Theoretic Concepts in Computer Science. WG 1987. Lecture Notes in Computer Science, vol 314. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19422-3_13
Download citation
DOI: https://doi.org/10.1007/3-540-19422-3_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19422-4
Online ISBN: 978-3-540-39264-4
eBook Packages: Springer Book Archive