Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,214,622 papers from all fields of science
Search
Sign In
Create Free Account
Graph (abstract data type)
Known as:
Graph
, Graph (computer science)
, Weighted, directed graph
Expand
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
25 relations
Abstract data type
Adjacency list
Adjacency matrix
Apache Spark
Expand
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
Abdullah Gharaibeh
,
L. Costa
,
Elizeu Santos-Neto
,
M. Ripeanu
IEEE 27th International Symposium on Parallel and…
2013
Corpus ID: 206929329
Graph processing has gained renewed attention. The increasing large scale and wealth of connected data, such as those accrued by…
Expand
2008
2008
Solving Minimum Power Broadcast Problem in Wireless Ad-Hoc Networks Using Genetic Algorithm
Xiang Wu
,
Xinheng Wang
,
R. Liu
Conference on Communication Networks and Services…
2008
Corpus ID: 14841653
A novel permutation encoded genetic algorithm (GA) is proposed for solving the minimum power broadcast (MPB) problem in wireless…
Expand
2008
2008
Alignment Results of Anchor-Flood Algorithm for OAEI-2008
M. Hanif
,
Masaki Aono
Organizational Memories
2008
Corpus ID: 14585736
Our proposed algorithm called Anchor-Flood algorithm, starts off with anchors. It gradually explores concepts by collecting…
Expand
2008
2008
Graph application on face for personal authentication and recognition
D. Kisku
,
A. Rattani
,
M. Tistarelli
,
Phalguni Gupta
International Conference on Control, Automation…
2008
Corpus ID: 15126097
This paper presents a novel face recognition technique with graph topology drawn on scale invariant feature transform (SIFT…
Expand
2008
2008
Using Stigmergy to Solve Numerical Optimization Problems
P. Korošec
,
J. Silc
Computing and informatics
2008
Corpus ID: 12700276
The current methodology for designing highly efficient technological systems needs to choose the best combination of the…
Expand
2005
2005
Hypergraph-Partitioning-Based Sparse Matrix Ordering
Ümit V. Çatalyürek
,
C. Aykanat
2005
Corpus ID: 7956069
Introduction In this work we propose novel sparse matrix ordering approaches based on hypergraph partitioning. The significance…
Expand
2003
2003
Programming with Circles , Triangles and Rectangles
Erik
,
Gavin
,
G. Bierman
2003
Corpus ID: 252340
This paper proposes extending popular object-oriented programming languages such as C#, VB or Java with native support for XML…
Expand
1999
1999
Type Domains for Abstract Interpretation : A critical study
P. Mildner
1999
Corpus ID: 13281422
Programming languages with dynamic typing such as Prolog do not require that the programmer declares the types of data or…
Expand
1997
1997
Query-Driven Data Allocation Algorithms for Distributed Database Systems
K. Karlapalem
,
Ng Moon Pun
International Conference on Database and Expert…
1997
Corpus ID: 11254046
The objective of a data allocation algorithm is to locate the fragments at different sites so as to minimize the total data…
Expand
1990
1990
Evaluation and selection of assembly plans
L. D. de Mello
,
A. Sanderson
Proceedings., IEEE International Conference on…
1990
Corpus ID: 54451652
Two criteria are introduced for the evaluation and selection of assembly plans. The first criterion is to maximize the number of…
Expand