In mathematics, and more specifically in graph theory, a graph is a structure amounting to a set of objects in which some pairs of the objects are inâ€¦Â (More)

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

Highly Cited

2015

Highly Cited

2015

- Siheng Chen, Rohan Varma, Aliaksei Sandryhaila, Jelena Kovacevic
- IEEE Transactions on Signal Processing
- 2015

We propose a sampling theory for signals that are supported on either directed or undirected graphs. The theory follows the sameâ€¦Â (More)

Is this relevant?

Highly Cited

2010

Highly Cited

2010

- Jure Leskovec, Deepayan Chakrabarti, Jon M. Kleinberg, Christos Faloutsos, Zoubin Ghahramani
- Journal of Machine Learning Research
- 2010

How can we generate realistic networks? In addition, how can we do so with a mathematically tractable model that allows forâ€¦Â (More)

Is this relevant?

Highly Cited

2009

Highly Cited

2009

- Santo Fortunato
- ArXiv
- 2009

The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevantâ€¦Â (More)

Is this relevant?

Highly Cited

2009

Highly Cited

2009

- Grzegorz Malewicz, Matthew H. Austern, +4 authors Grzegorz Czajkowski
- SPAA
- 2009

Many practical computing problems concern large graphs. Standard examples include the Web graph and various social networks. Theâ€¦Â (More)

Is this relevant?

Highly Cited

2006

Highly Cited

2006

- Geoffrey E. Hinton, Simon Osindero, Yee Whye Teh
- Neural Computation
- 2006

We show how to use "complementary priors" to eliminate the explaining-away effects that make inference difficult in denselyâ€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

How can we generate realistic graphs? In addition, how can we do so with a mathematically tractable model that makes it feasibleâ€¦Â (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- Reza Olfati-Saber, Richard M. Murray
- IEEE Transactions on Automatic Control
- 2004

In this paper, we discuss consensus problems for networks of dynamic agents with fixed and switching topologies. We analyze threeâ€¦Â (More)

Is this relevant?

Highly Cited

1991

Highly Cited

1991

- Thomas M. J. Fruchterman, Edward M. Reingold
- Softw., Pract. Exper.
- 1991

A graph G = (V,E) is a set V of vertices and a set E of edges, in which an edge joins a pair of vertices. 1 Normally, graphs areâ€¦Â (More)

Is this relevant?

Highly Cited

1988

Highly Cited

1988

- Shinji Umeyama
- IEEE Trans. Pattern Anal. Mach. Intell.
- 1988

Absfruct-This paper discusses an approximate solution to the weighted graph matching prohlem (WGMP) for both undirected andâ€¦Â (More)

Is this relevant?

Highly Cited

1986

Highly Cited

1986

- Randal E. Bryant
- IEEE Transactions on Computers
- 1986

In this paper we present a new data structure for representing Boolean functions and an associated set of manipulation algorithmsâ€¦Â (More)

Is this relevant?