Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
graph construction algorithm
Description:
An algorithm for generating a graph from specified data, rules, or constraints in computational modeling and graph-based applications.
Related topics:
Advanced Graph Theory Research (13%),
Computational Geometry and Mesh Generation (12%)
OpenAlex ID:
keywords/graph-construction-algorithm
Relative neighborhood graphs and their relatives
1992
·
J.W. Jaromczyk
, G.T. Toussaint
·
Proceedings of the IEEE
·
754
Design to Minimize Diameter on Building-Block Network
1981
·
Imase
, Itoh
·
IEEE Transactions on Computers
·
230
Algorithms for constructing graphs and digraphs with given valences and factors
1973
·
D.J. Kleitman
, D.L. Wang
·
Discrete Mathematics
·
216
Automatic construction of sparse data flow evaluation graphs
1991
·
Jong-Deok Choi
, Ron Cytron
, et al.
·
ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL)
·
205
Graphs and mathematical morphology
1989
·
Luc Vincent
·
Signal Processing
·
186
The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees
1983
·
Kenneth J. Supowit
·
Journal of the ACM
·
179
PDF
Epileptic seizure detection in EEGs signals using a fast weighted horizontal visibility algorithm
2014
·
Guohun Zhu
, Yan Li
, et al.
·
Computer Methods and Programs in Biomedicine
·
177
Degree maximal graphs are Laplacian integral
1994
·
Russell Merris
·
Linear Algebra and its Applications
·
164
PDF
New methods for computing visibility graphs
1988
·
M. H. Overmars
, E. Welzl
·
Annual Symposium on Computational Geometry (SoCG)
·
164
SplitMEM: a graphical algorithm for pan-genome analysis with suffix skips
2014
·
Shoshana Marcus
, Hayan Lee
, et al.
·
Bioinformatics
·
141
PDF
Dependence-based program analysis
1993
·
Richard Johnson
, Keshav Pingali
·
ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)
·
127
Which triangulations approximate the complete graph? Conference abstract
1989
·
Gautam Das
, Deborah Joseph
·
Lecture notes in computer science
·
120
A Fast Algorithm for Constructing Sparse Euclidean Spanners
1997
·
Gautam Das
, Giri Narasimhan
·
International Journal of Computational Geometry & Applications
·
97
Constructing Plane Spanners of Bounded Degree and Low Weight
2005
·
Prosenjit Bose
, Joachim Gudmundsson
, et al.
·
Algorithmica
·
96
Interval graphs and maps of DNA
1986
·
Michael S. Waterman
, Jerrold R. Griggs
·
Bulletin of Mathematical Biology
·
94
Practical Construction of k-Nearest Neighbor Graphs in Metric Spaces
2006
·
Rodrigo Paredes
, Edgar Chávez
, et al.
·
Lecture notes in computer science
·
88
Connectivity considerations in the design of survivable networks
1970
·
H. Frank
, Wushow Chou
·
IEEE Transactions on Circuit Theory
·
80
Constructing Multidimensional Spanner Graphs
1991
·
JEFFERY S. SALOWE
·
International Journal of Computational Geometry & Applications
·
74
Distributed Secure Control Against Denial-of-Service Attacks in Cyber-Physical Systems Based on K-Connected Communication Topology
2020
·
Tian-Yu Zhang
, Dan Ye
·
IEEE Transactions on Cybernetics
·
62
On the existence of N‐connected graphs with prescribed degrees (n ≧ 2)
1973
·
D. L. Wang
, D. J. Kleitman
·
Networks
·
57
The Existence of Completely Independent Spanning Trees for Some Compound Graphs
2019
·
Xiao-Wen Qin
, Rong-Xia Hao
, et al.
·
IEEE Transactions on Parallel and Distributed Systems
·
51
Construction of planar triangulations with minimum degree 5
2005
·
G. Brinkmann
, Brendan D. McKay
·
Discrete Mathematics
·
49
PDF
Recursive construction for 3-regular expanders
1994
·
M. Ajtai
·
COMBINATORICA
·
46
Self-complementary graphs
1974
·
Richard A Gibbs
·
Journal of Combinatorial Theory Series B
·
46
PDF
Constructing Plane Spanners of Bounded Degree and Low Weight
2002
·
Prosenjit Bose
, Joachim Gudmundsson
, et al.
·
Lecture notes in computer science
·
45
Show more works
View as search
Works count:
307
Citation count:
5,059
Year
Topic
Type