Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2019
Highly Cited
2019
Graph Neural Networks (GNNs) are an effective framework for representation learning of graphs. GNNs follow a neighborhood… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Highly Cited
2018
Highly Cited
2018
We present graph attention networks (GATs), novel neural network architectures that operate on graph-structured data, leveraging… Expand
  • figure 1
  • table 1
  • table 2
  • table 3
  • figure 2
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… Expand
  • figure 1
  • table 2
  • table 3
  • figure 2
  • figure 3
Highly Cited
2016
Highly Cited
2016
Abstract: Graph-structured data appears frequently in domains including chemistry, natural language semantics, social networks… Expand
  • figure 1
  • table 1
  • table 2
  • table 3
  • figure 3
Review
2016
Review
2016
Relational machine learning studies methods for the statistical analysis of relational, or graph-structured, data. In this paper… Expand
  • figure 1
  • table I
  • table II
  • figure 2
  • figure 3
Highly Cited
2010
Highly Cited
2010
Many practical computing problems concern large graphs. Standard examples include the Web graph and various social networks. The… Expand
  • figure 2
Highly Cited
2004
Highly Cited
2004
We introduce a stochastic graph-based method for computing relative importance of textual units for Natural Language Processing… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • table 2
Highly Cited
2004
Highly Cited
2004
In this correspondence, the construction of low-density parity-check (LDPC) codes from circulant permutation matrices is… Expand
Highly Cited
2001
Highly Cited
2001
  • L. Gao
  • TNET
  • 2001
  • Corpus ID: 5009545
The Internet consists of rapidly increasing number of hosts interconnected by constantly evolving networks of links and routers… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • table 1
Highly Cited
1993
Highly Cited
1993
  • Z. Wu, R. Leahy
  • IEEE Trans. Pattern Anal. Mach. Intell.
  • 1993
  • Corpus ID: 2595046
A novel graph theoretic approach for data clustering is presented and its application to the image segmentation problem is… Expand
  • table I
  • figure 1
  • figure 2
  • figure 3
  • figure 5