# Adjacency list

## Papers overview

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

2016

2016

- 2016

Hierarchical data are found in a variety of database applications, including content management categories, forums, businessâ€¦Â (More)

Is this relevant?

2015

2015

- SpringSim
- 2015

In the era of Bigdata, we are deluged with massive graph data emerged from numerous social and scientific applications. In mostâ€¦Â (More)

Is this relevant?

2014

2014

- IHM
- 2014

As the nature and types of graphs in numerous fields such as social sciences, engineering, and biology continue to proliferateâ€¦Â (More)

Is this relevant?

2008

2008

- 2008 4th International Conference on Wirelessâ€¦
- 2008

Mining preferred browsing paths from Web logs can help improve the structure of Web sites and increase the click-stream. In thisâ€¦Â (More)

Is this relevant?

2007

2007

- GECCO
- 2007

We propose and analyze a novel genotype to represent walk and cycle covers in graphs, namely matchings in the adjacency listsâ€¦Â (More)

Is this relevant?

2007

2007

- ISAAC
- 2007

We study the complexity of structurally restricted homomorphism and constraint satisfaction problems. For every class ofâ€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- Electronic Colloquium on Computational Complexity
- 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)

Is this relevant?

2004

2004

- Discrete Mathematics
- 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)

Is this relevant?

Highly Cited

1997

Highly Cited

1997

- Algorithmica
- 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

- SIAM J. Comput.
- 1986

In this paper the problem of minimal representations for particular classes of directed hypergraphs is analyzed. Various conceptsâ€¦Â (More)

Is this relevant?