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.
2016
2016
Incidences with curves and surfaces in three dimensions, with applications to distinct and repeated distances
We study a wide spectrum of incidence problems involving points and curves or points and surfaces in $\mathbb R^3$. The current… 
2015
2015
Adaptive finite element analysis of elliptic problems based on bubble-type local mesh generation
2010
2010
Graph Drawing Aesthetics in User-Sketched Graph Layouts
Empirical work on appropriate layout aesthetics for graph drawing algorithms has concentrated on the interpretation of existing… 
2009
2009
Fuzzy Graphs and Fuzzy Hypergraphs
Graph theory has numerous application to problems in systems analysis, operations research, economics, and transportation… 
2006
2006
Algorithms for the Homogeneous Set Sandwich Problem
AbstractA homogeneous set is a non-trivial module of a graph, i.e. a non-empty, non-unitary, proper subset of a graph's vertices… 
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… 
1997
1997
The Incremental Maintenance of a Depth-First-Search Tree in Directed Acyclic Graphs
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… 
1993
1993
Breadth-Depth Search is P-Complete
The parallel complexity of a search strategy that combines attributes of both breadth-first search and depth-first search is… 
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)