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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2016

We study a wide spectrum of incidence problems involving points and curves or points and surfaces in $\mathbb R^3$. The current…

2015

2010

We propose an algorithm to determine stable connected dominating sets (CDS), based on the predicted link expiration time (LET…

2009

Graph theory has numerous application to problems in systems analysis, operations research, economics, and transportation…

2007

In this paper, a versatile edge-centered data structure is presented based on an analysis about classical representations of…

2002

2001

Massively parallel computing techniques can overcome limitations of problem size a nd space resolution for r eservoir simulation…

1998

Edgebreaker is a simple scheme for compressing the triangle/vertex incidence graphs (sometimes called topology) of…

1996

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

The parallel complexity of a search strategy that combines attributes of both breadth-first search and depth-first search is…