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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1936-2017
010203019362016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
  • Cornelia Győrödi, Romulus-Radu Moldovan-Dușe, Robert Győrödi, George Pecherle
  • 2016
Hierarchical data are found in a variety of database applications, including content management categories, forums, business… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
2015
2015
In the era of Bigdata, we are deluged with massive graph data emerged from numerous social and scientific applications. In most… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2014
2014
As the nature and types of graphs in numerous fields such as social sciences, engineering, and biology continue to proliferate… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2008
2008
Mining preferred browsing paths from Web logs can help improve the structure of Web sites and increase the click-stream. In this… (More)
  • table I
  • figure 1
  • figure 2
Is this relevant?
2007
2007
We propose and analyze a novel genotype to represent walk and cycle covers in graphs, namely matchings in the adjacency lists… (More)
  • figure 1
  • table 1
Is this relevant?
2007
2007
We study the complexity of structurally restricted homomorphism and constraint satisfaction problems. For every class of… (More)
  • figure 1
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We consider the problem of estimating the size, V C(G), of a minimum vertex cover of a graph G, in sublinear time, by querying… (More)
  • figure 1
Is this relevant?
2004
2004
We prove that the incidence coloring number of every k-degenerated graph G is at most (G) + 2k − 1. For K4-minor free graphs (k… (More)
  • figure 1
Is this relevant?
Highly Cited
1997
Highly Cited
1997
We further develop the study of testing graph properties as initiated by Goldreich, Goldwasser and Ron. Loosely speaking, given… (More)
Is this relevant?
Highly Cited
1986
Highly Cited
1986
In this paper the problem of minimal representations for particular classes of directed hypergraphs is analyzed. Various concepts… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?