Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

25 relations
Abstract data typeAdjacency listAdjacency matrixApache Spark

Broader (1)

Graph theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
On Graphs, GPUs, and Blind Dating: A Workload to Processor Matchmaking Quest
Graph processing has gained renewed attention. The increasing large scale and wealth of connected data, such as those accrued by… 
Highly Cited
2010
Highly Cited
2010
Age invariant face recognition using graph matching
In this paper, we present a graph based face representation for efficient age invariant face recognition. The graph contains… 
Highly Cited
2007
Highly Cited
2007
Stipple Placement using Distance in a Weighted Graph
We present a stipple placement method which provides extra emphasis to image features, especially edges. Our algorithm transforms… 
2003
2003
Programming with Circles , Triangles and Rectangles
This paper proposes extending popular object-oriented programming languages such as C#, VB or Java with native support for XML… 
Highly Cited
1996
Highly Cited
1996
A systolic architecture for LMS adaptive filtering with minimal adaptation delay
Existing systolic architectures for the LMS algorithm with delayed coefficient adaptation have large adaptation delay and hence… 
Highly Cited
1993
Highly Cited
1993
A Structural Theory of Explanation-Based Learning
1993
1993
Sequentializing Program Dependence Graphs for Irreducible Programs
Compilers using a parallel intermediate program representation like the program dependence graph must sequentialize the code as… 
1990
1990
Maintaining geometric dependencies in an assembly planner
  • R. WilsonJ. Rit
  • Proceedings., IEEE International Conference on…
  • 1990
  • Corpus ID: 54452790
The problem of generating assembly sequences strictly from the geometry of a goal assembly is addressed. The planner considers 2… 
1988
1988
Planning repair sequences using the AND/OR graph representation of assembly plans
A simple modification is shown in the set of goal nodes of the AND/OR graph that allows its use in planning repairs such as the… 
Highly Cited
1983
Highly Cited
1983
Minimum-Via Topological Routing
  • Chi-Ping Hsu
  • IEEE Trans. Comput. Aided Des. Integr. Circuits…
  • 1983
  • Corpus ID: 17126741
A new approach to the two-dimensional routing utilizing two layers is proposed. It consists of two major steps, topological… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)