Skip to main content
SpringerLink
Log in

On the path representation of networks

  • Part I Computer Science
  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

A compact data structure for networks is obtained by storing arcs of paths sequentially. This structure allows forward and backward access from a node to its neighbors.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Reference

  1. S. Even,Graph Algorithms, Computer Science Press, Woodland Hills, California (1979).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Jyväskylä, SF-40100, Jyväskylä 10, Finland

    A. Perko

Authors
  1. A. Perko
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Perko, A. On the path representation of networks. BIT 22, 300–302 (1982). https://doi.org/10.1007/BF01934443

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01934443

Keywords

Search

Navigation