Premium
An edge‐oriented adjacency list for undirected graphs
Author(s) -
Chen L. K.,
Ting B. S.,
SangiovanniVincentelli A.
Publication year - 1979
Publication title -
international journal of circuit theory and applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.364
H-Index - 52
eISSN - 1097-007X
pISSN - 0098-9886
DOI - 10.1002/cta.4490070107
Subject(s) - adjacency list , undirected graph , combinatorics , enhanced data rates for gsm evolution , computer science , adjacency matrix , mathematics , graph , discrete mathematics , artificial intelligence
A new data structure, called the Edge‐Oriented Adjacency List (EOAL), for representing undirected graphs is presented. It provides more information on the edges and requires less storage space than the conventional adjacency list. Furthermore, it is superior to the conventional adjacency list in both insertion and deletion operations.