A versatile data structure for edge-oriented graph algorithms

Authors:
Jürgen Ebert
Affiliations:
EHW Koblenz, Informatik, Rheinau 3-4, 5400 Koblenz, West Germany
Venue:
Communications of the ACM
Year:
1987

Citing 2
Cited 4

Graph Algorithms

Graph Algorithms
Graphs and Hypergraphs

Graphs and Hypergraphs

A deadlock detection and recovery algorithm using the formalism of a directed graph matrix

ACM SIGOPS Operating Systems Review
Trading uninitialized space for time

Information Processing Letters
Reverse engineering using graph queries

Graph transformations and model-driven engineering
Practical perfect hashing in nearly optimal space

Information Systems

Quantified Score

Hi-index	48.22

Visualization

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.