Graph (discrete mathematics)

Known as: Simple graph, Finite undirected graph, Undirected 
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)
Wikipedia

Topic mentions per year

Topic mentions per year

1938-2017
0500100019382016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
We propose a sampling theory for signals that are supported on either directed or undirected graphs. The theory follows the same… (More)
  • figure 1
  • table I
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2010
Highly Cited
2010
How can we generate realistic networks? In addition, how can we do so with a mathematically tractable model that allows for… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2009
Highly Cited
2009
The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Many practical computing problems concern large graphs. Standard examples include the Web graph and various social networks. The… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2006
Highly Cited
2006
We show how to use "complementary priors" to eliminate the explaining-away effects that make inference difficult in densely… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 5
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)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2004
Highly Cited
2004
In this paper, we discuss consensus problems for networks of dynamic agents with fixed and switching topologies. We analyze three… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1991
Highly Cited
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)
  • figure 2
  • figure 3
  • figure 5
  • figure 7
  • figure 8
Is this relevant?
Highly Cited
1988
Highly Cited
1988
Absfruct-This paper discusses an approximate solution to the weighted graph matching prohlem (WGMP) for both undirected and… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table II
Is this relevant?
Highly Cited
1986
Highly Cited
1986
In this paper we present a new data structure for representing Boolean functions and an associated set of manipulation algorithms… (More)
  • figure 2
  • table 2
  • figure 11
Is this relevant?