Product
Help
Pricing
About
Jobs
Log in
Get started
Concept
Add to collection
Butterfly graph
OpenAlex ID:
C18819970
Graph minors. V. Excluding a planar graph
1986
·
Neil Robertson
, P.D Seymour
·
Journal of Combinatorial Theory Series B
·
1,031
Graph minors. III. Planar tree-width
1984
·
Neil Robertson
, P.D Seymour
·
Journal of Combinatorial Theory Series B
·
1,015
Adaptive Graph Convolutional Neural Networks
2018
·
Ruoyu Li
, Sheng Wang
, et al.
·
Proceedings of the AAAI Conference on Artificial Intelligence
·
923
Depth-first search and linear graph algorithms
1971
·
Robert Tarjan
·
Annual Symposium on Switching & Automata Theory
·
782
A New Algorithm for Generating All the Maximal Independent Sets
1977
·
Shuji Tsukiyama
, Mikio Ide
, et al.
·
SIAM Journal on Computing
·
696
Classes of graphs which approximate the complete euclidean graph
1992
·
J. Mark Keil
, Carl A. Gutwin
·
Discrete & Computational Geometry
·
408
PDF
Graph summarization with bounded error
2008
·
Saket Navlakha
, Rajeev Rastogi
, et al.
·
ACM SIGMOD International Conference on Management of Data (SIGMOD)
·
398
Eigenvalues and graph bisection: An average-case analysis
1987
·
Ravi B. Boppana
·
Annual Symposium on Foundations of Computer Science
·
396
Analysis of multilevel graph partitioning
1995
·
George Karypis
, Vipin Kumar
·
ACM/IEEE Conference on Supercomputing (SC)
·
383
Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design
2010
·
Vicky Choi
·
Quantum Information Processing
·
352
PDF
There are planar graphs almost as good as the complete graph
1989
·
L. Paul Chew
·
Journal of Computer and System Sciences
·
309
PDF
Graph Partitioning and Graph Clustering
2013
·
Bader, David
, Meyerhenke, Henning
, et al.
·
Contemporary mathematics - American Mathematical Society
·
276
Algorithmic Graph Theory
1989
·
James A. M. McHugh
·
258
Circle Graph Obstructions
1994
·
A. Bouchet
·
Journal of Combinatorial Theory Series B
·
234
Design to Minimize Diameter on Building-Block Network
1981
·
Imase
, Itoh
·
IEEE Transactions on Computers
·
233
Graph exploration by a finite automaton
2005
·
Pierre Fraigniaud
, David Ilcinkas
, et al.
·
Theoretical Computer Science
·
222
PDF
Analyzing graph structure via linear measurements
2012
·
Kook Jin Ahn
, Sudipto Guha
, et al.
·
ScholarlyCommons (University of Pennsylvania)
·
216
PDF
An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
1974
·
Philippe G. H. Lehot
·
Journal of the ACM
·
205
PDF
Arrangement graphs: a class of generalized star graphs
1992
·
Khaled Day
, Anand Tripathi
·
Information Processing Letters
·
204
The strong chromatic index of a cubic graph is at most 10
1992
·
Lars Døvling Andersen
·
Discrete Mathematics
·
189
On an upper bound of a graph's chromatic number, depending on the graph's degree and density
1977
·
O.V Borodin
, A.V Kostochka
·
Journal of Combinatorial Theory Series B
·
188
Graph distances using graph union
2001
·
W.D. Wallis
, P. Shoubridge
, et al.
·
Pattern Recognition Letters
·
186
Influence of graph construction on graph-based clustering measures
2008
·
Markus Maier
, Ulrike von Luxburg
, et al.
·
neural information processing systems
·
185
Queues, Stacks and Graphs
1971
·
S. Even
, A. Itai
·
Elsevier eBooks
·
185
On Linear Time Minor Tests with Depth-First Search
1993
·
H.L. Bodlaender
·
Journal of Algorithms
·
174
Show more works
View as search
Works count:
2,512
Citation count:
24,750
Year
Topic
Type