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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
We propose an algorithm to determine stable connected dominating sets (CDS), based on the predicted link expiration time (LET… 
2010
2010
In semantic Web, the extensive reuse of existing ontology is a central idea of ontology engineering. Ontology partitioning… 
2008
2008
  • D. Crisp
  • 2008
  • Corpus ID: 17445025
One of the more successful approaches to image segmentation involves formulating the problem as the minimisation of a Mumford… 
2006
2006
We present an efficient fixed-parameter algorithm for #SAT parameterized by the incidence treewidth, i.e., the treewidth of the… 
2004
2004
Recently, the IDS(Intrusion Detection System) with a use of a video camera is an important part of the home security systems… 
2001
2001
Massively parallel computing techniques can overcome limitations of problem size a nd space resolution for r eservoir simulation… 
1998
1998
Edgebreaker is a simple scheme for compressing the triangle/vertex incidence graphs (sometimes called topology) of… 
1988
1988
  • Steve Meyer
  • 1988
  • Corpus ID: 26269928
A data structure for storing and processing electrical circuit net lists is described. The basic data structure is not new, but… 
Review
1988
Review
1988
Nontraditional applications of database systems require the efficient evaluation of recursive queries. The transitive closure of… 
1977
1977