Thumbnail
Access Restriction
Subscribed

Author Ebert, Jürgen
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
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.
Description Affiliation: EHW Koblenz, Informatik, Rheinau 3-4, 5400 Koblenz, West Germany (Ebert, Jürgen)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 30
Issue Number 6
Page Count 7
Starting Page 513
Ending Page 519


Open content in new tab

   Open content in new tab
Source: ACM Digital Library