ScholarLens Back to search
1979•International Journal of Circuit Theory and ApplicationsRequires access

An edge‐oriented adjacency list for undirected graphs

Li-An Chen, B. Ting, Alberto Sangiovanni‐Vincentelli

Open publisher page 1 citations

Abstract

Abstract 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.

About this research paper

What this paper is about

Abstract 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.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Abstract 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.

Key concepts: Adjacency list, Undirected graph, Combinatorics, Enhanced Data Rates for GSM Evolution, Computer science, Adjacency matrix, Mathematics, Graph

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
An edge‐oriented adjacency list for undirected graphs — Research Paper | ScholarLens