External labeling and algorithms for hierarchic networks

  • Aarni Perko
Data Bases
Part of the Lecture Notes in Computer Science book series (LNCS, volume 314)


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.


Head Node Final Network Hierarchy Class Node Table Internal Data Structure 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Ebert, J.: A versatile data structure for edge-oriented graph algorithms. Communications of the ACM 30 (1987) 513–519.CrossRefGoogle Scholar
  2. [2]
    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.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Aarni Perko
    • 1
  1. 1.Department of MathematicsUniversity of JyväskyläJyväskyläFinland

Personalised recommendations