Skip to search formSkip to main contentSkip to account menu

Adjacency list

Known as: Edge list representation, Adjacency list model, Incidence list 
In graph theory and computer science, an adjacency list is a collection of unordered lists used to represent a finite graph. Each list describes the… 
Wikipedia (opens in a new tab)

Related topics

Related topics

27 relations
Adjacency matrixArray data structureAssociative model of dataBreadth-first search

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Adaptive finite element analysis of elliptic problems based on bubble-type local mesh generation
2014
2014
A Characterization of PM-Compact claw-Free cubic graphs
The perfect matching polytope of a graph G is the convex hull of the incidence vectors of all perfect matchings in G. This paper… 
2010
2010
Predicted Link Expiration Time Based Connected Dominating Sets for Mobile Ad hoc Networks
We propose an algorithm to determine stable connected dominating sets (CDS), based on the predicted link expiration time (LET… 
2007
2007
Calculating Shortest Path on Edge-Based Data Structure of Graph
In this paper, a versatile edge-centered data structure is presented based on an analysis about classical representations of… 
2002
2002
On incidence coloring for some cubic graphs
2001
2001
Parallel Computing Techniques for Large-Scale Reservoir Simulation of Multi- Component and Multiphase Fluid Flow
Massively parallel computing techniques can overcome limitations of problem size a nd space resolution for r eservoir simulation… 
1998
1998
Edgebreaker: Compressing the incidence graph of triangle meshes
Edgebreaker is a simple scheme for compressing the triangle/vertex incidence graphs (sometimes called topology) of… 
1996
1996
A Linear Algorithm for Maximum Weight Cliques in Proper Circular Arc Graphs
We present an $O(n)$ algorithm to find a maximum clique in a proper circular arc graph. We assume that the input graph is… 
1996
1996
On the construction of the Kan loop group
A re-make, not of the construction, but of its description. By an ordered graph will be meant a triple of sets (P;N;E) together… 
Review
1988
Review
1988
Transitive Closure Algorithms for Very Large Databases
Nontraditional applications of database systems require the efficient evaluation of recursive queries. The transitive closure of… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)