Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A versatile data structure for edge-oriented graph algorithms

A versatile data structure for edge-oriented graph algorithms An abstract graph module that allows for easy and secure programming of a great number of graph algorithms is implemented by symmetrically stored forward and backward adjacency lists, thus supporting edge-oriented traversals of general directed and undirected graphs. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Communications of the ACM Association for Computing Machinery

A versatile data structure for edge-oriented graph algorithms

Ebert, Jürgen
Communications of the ACM , Volume 30 (6) – Jun 1, 1987
Download PDF
7 pages

Loading next page...
 
/lp/association-for-computing-machinery/a-versatile-data-structure-for-edge-oriented-graph-algorithms-UcmTIvC5Kk

References (9)

Publisher
Association for Computing Machinery
Copyright
Copyright © 1987 by ACM Inc.
ISSN
0001-0782
DOI
10.1145/214762.214769
Publisher site
See Article on Publisher Site

Abstract

An abstract graph module that allows for easy and secure programming of a great number of graph algorithms is implemented by symmetrically stored forward and backward adjacency lists, thus supporting edge-oriented traversals of general directed and undirected graphs.

Journal

Communications of the ACM – Association for Computing Machinery

Published: Jun 1, 1987

There are no references for this article.