Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
recursive graphs
Description:
Graphs defined or constructed through repeated rules that relate larger graph structures to smaller instances.
Related topics:
Computability, Logic, AI Algorithms (18%),
Interconnection Networks and Systems (8%)
OpenAlex ID:
keywords/recursive-graphs
What is special about diffusion on scale-free nets?
2005
·
Erik M Bollt
, Daniel ben-Avraham
·
New Journal of Physics
·
125
PDF
Low-algorithmic-complexity entropy-deceiving graphs
2017
·
Hector Zenil
, Narsis A. Kiani
, et al.
·
Physical review. E
·
91
PDF
Phase transitions and random walks on graphs: A generalization of the Mermin-Wagner theorem to disordered lattices, fractals, and other discrete structures
1992
·
Davide Cassi
·
Physical Review Letters
·
83
On the complexity of finding the chromatic number of a recursive graph I: the bounded case
1989
·
Richard Beigel
, William I. Gasarch
·
Annals of Pure and Applied Logic
·
36
Hamiltonian paths in infinite graphs
1991
·
David Harel
·
Israel Journal of Mathematics
·
31
Some natural decision problems in automatic graphs
2010
·
Dietrich Kuske
, Markus Lohrey
·
Journal of Symbolic Logic
·
25
Recursive Graphs, Recursive Labelings and Shortest Paths
1981
·
Andrzej Proskurowski
·
SIAM Journal on Computing
·
25
Taking it to the limit: on infinite variants of NP-complete problems
2002
·
T. Hirst
, D. Harel
·
IEEE Conference on Computational Complexity (CCC)
·
24
A Model for Representing Programs Using Hierarchical Graphs
1981
·
S.S. Yau
, P.C. Grabow
·
IEEE Transactions on Software Engineering
·
23
Towards a theory of recursive structures
1998
·
David Harel
·
Lecture notes in computer science
·
21
Corona graphs as a model of small-world networks
2015
·
Qian Lv
, Yuhao Yi
, et al.
·
Journal of Statistical Mechanics Theory and Experiment
·
19
PDF
Taking It to the Limit: On Infinite Variants of NP-Complete Problems
1996
·
Tirza Hirst
, David Harel
·
Journal of Computer and System Sciences
·
16
Spectral dimension of branched structures: Universality in geometrical disorder
1993
·
Davide Cassi
, Sofia Regina
·
Physical Review Letters
·
16
Efficient and Systematic Partitioning of Large and Deep Neural Networks for Parallelization
2021
·
Haoran Wang
, Chong Li
, et al.
·
Lecture notes in computer science
·
15
On the complexity of finding the chromatic number of a recursive graph II: the unbounded case
1989
·
Richard Beigel
, William I. Gasarch
·
Annals of Pure and Applied Logic
·
15
Feasible Graphs and Colorings
1995
·
Douglas Cenzer
, Jeffrey Remmel
·
Mathematical logic quarterly
·
14
Chapter 18 Recursive and on-line graph coloring
1998
·
H.A. Kierstead
·
Studies in logic and the foundations of mathematics
·
13
Hamiltonian paths in infinite graphs
1991
·
David Harel
·
ACM Symposium on Theory of Computing (STOC)
·
11
PDF
A generalized Beraha conjecture for non-planar graphs
2013
·
Jesper Lykke Jacobsen
, Jesús Salas
·
Nuclear Physics B
·
10
PDF
A design process formalization
2005
·
M. Harada
, T.L. Kunii
·
IEEE Annual International Computer Software and Applications Conference (COMPSAC)
·
10
On Schmerl's effective version of Brooks' theorem
1984
·
Helge Tverberg
·
Journal of Combinatorial Theory Series B
·
10
PDF
Embedding Augmented Cube into Certain Trees and Windmill Graphs
2023
·
A. Berin Greeni
, R. Sundara Rajan
, et al.
·
International Journal of Foundations of Computer Science
·
9
Evolutionary drawing formalization in an engineering database environment
2005
·
A.P. Buchmann
, T.L. Kunii
·
IEEE Annual International Computer Software and Applications Conference (COMPSAC)
·
9
The Block-Polynomials and Block-Spectra of Dendrimers #
2002
·
BioChem Press
, Vladimir R. Rosenfeld
, et al.
·
8
State Assessment of Key Equipment of Microgrid Based on Multi-source Data Fusion Method
2022
·
Jianhong Qiu
, Yafeng Liang
, et al.
·
IEEE Joint International Information Technology and Artificial Intelligence Conference (ITAIC)
·
7
Show more works
View as search
Works count:
97
Citation count:
780
Year
Topic
Type