Graph (abstract data type)

Known as: Graph, Graph (computer science), Weighted, directed graph 
In computer science, a graph is an abstract data type that is meant to implement the undirected graph and directed graph concepts from mathematics. A… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2017
Highly Cited
2017
We present a scalable approach for semi-supervised learning on graph-structured data that is based on an efficient variant of… (More)
  • figure 1
  • table 2
  • table 3
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2014
Highly Cited
2014
In pursuit of graph processing performance, the systems community has largely abandoned general-purpose distributed dataflow… (More)
Is this relevant?
Highly Cited
2013
Highly Cited
2013
From social networks to targeted advertising, big graphs capture the structure in data and are central to recent advances in… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2012
Highly Cited
2012
For many problems arising in the setting of graph querying (such as finding semantic associations in RDF graphs, exact and… (More)
  • figure 1
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Many practical computing problems concern large graphs. Standard examples include the Web graph and various social networks. The… (More)
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Keyword search on graph structured data has attracted a lot of attention in recent years. Graphs are a natural “lowest common… (More)
  • figure 2
  • figure 1
  • figure 4
  • figure 3
  • figure 5
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Query processing over graph-structured data is enjoying a growing number of applications. A top-k keyword search query on a graph… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We introduce a stochastic graph-based method for computing relative importance of textual units for Natural Language Processing… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Basket Analysis, which is a standard method for data mining, derives frequent itemsets from database. However, its mining ability… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2002
Highly Cited
2002
MOTIVATION Progressive Multiple Sequence Alignment (MSA) methods depend on reducing an MSA to a linear profile for each alignment… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?