Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
infinite paths
Description:
These are paths consisting of infinitely many successive steps or states, studied in graph theory, logic, and related mathematical fields.
Related topics:
Stochastic processes and statistical mechanics (12%),
Formal Methods in Verification (12%),
Advanced Graph Theory Research (10%),
Advanced Topology and Set Theory (9%),
Computability, Logic, AI Algorithms (8%)
OpenAlex ID:
keywords/infinite-paths
Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
1990
·
Ariel Orda
, Raphael Rom
·
Journal of the ACM
·
583
PDF
Infinite Runs in Weighted Timed Automata with Energy Constraints
2008
·
Patricia Bouyer
, Uli Fahrenberg
, et al.
·
Lecture notes in computer science
·
273
PDF
Über unendliche Wege in Graphen
1964
·
R. Halin
·
Mathematische Annalen
·
253
Markov Chains Indexed by Trees
1994
·
Itai Benjamini
, Yuval Peres
·
The Annals of Probability
·
190
PDF
Effective transformations on infinite trees, with applications to high undecidability, dominoes, and fairness
1986
·
David Harel
·
Journal of the ACM
·
160
PDF
Über die Maximalzahl fremder unendlicher Wege in Graphen
1965
·
R. Halin
·
Mathematische Nachrichten
·
121
Fixed‐edge theorem for graphs with loops
1979
·
Richard Nowakowski
, Ivan Rival
·
Journal of Graph Theory
·
116
Sampling-based temporal logic path planning
2013
·
Cristian Ioan Vasile
, Calin Belta
·
IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)
·
109
Wurzelbäume und unendliche Wege in Graphen
1969
·
H. A. Jung
·
Mathematische Nachrichten
·
83
Automatic linear orders and trees
2005
·
Bakhadyr Khoussainov
, Sasha Rubin
, et al.
·
ACM Transactions on Computational Logic
·
74
Dynamical properties of the Pascal adic transformation
2004
·
XAVIER MÉLA
, KARL PETERSEN
·
Ergodic Theory and Dynamical Systems
·
67
PDF
Cantor aperiodic systems and Bratteli diagrams
2005
·
Konstantin Medynets
·
Comptes Rendus Mathématique
·
61
PDF
The S-packing chromatic number of a graph
2012
·
Wayne Goddard
, Honghai Xu
·
Discussiones Mathematicae Graph Theory
·
58
PDF
Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata
2008
·
Christel Baier
, Nathalie Bertrand
, et al.
·
ACM/IEEE Symposium on Logic in Computer Science (LICS)
·
52
Die Maximalzahl fremder zweiseitig unendlicher Wege in Graphen
1970
·
R. Halin
·
Mathematische Nachrichten
·
45
Length considerations in context-free languages
1997
·
Danny Raz
·
Theoretical Computer Science
·
41
How complicated is the set of stable models of a recursive logic program?
1992
·
W. Marek
, A. Nerode
, et al.
·
Annals of Pure and Applied Logic
·
39
A reduction from parity games to simple stochastic games
2011
·
Krishnendu Chatterjee
, Nathanaël Fijalkow
·
Electronic Proceedings in Theoretical Computer Science
·
38
A generalization of McDiarmid's theorem for mixed Bernoulli percolation
1980
·
J. M. Hammersley
·
Mathematical Proceedings of the Cambridge Philosophical Society
·
38
A souslin operation for Π 2 1
1971
·
Richard Mansfield
·
Israel Journal of Mathematics
·
38
Ricci-flat graphs with girth at least five
2014
·
Yong Lin
, Linyuan Lu
, et al.
·
Communications in Analysis and Geometry
·
37
PDF
On automatic partial orders
2003
·
B. Khoussainov
, S. Rubin
, et al.
·
ACM/IEEE Symposium on Logic in Computer Science (LICS)
·
36
A lower bound technique for radio k -coloring
2017
·
Sandip Das
, Sasthi C. Ghosh
, et al.
·
Discrete Mathematics
·
35
PDF
Infinite paths that contain only shortest paths
1986
·
Mark E. Watkins
·
Journal of Combinatorial Theory Series B
·
34
PDF
Extensions of simple modules over Leavitt path algebras
2015
·
Gene Abrams
, Francesca Mantese
, et al.
·
Journal of Algebra
·
29
PDF
Show more works
View as search
Works count:
281
Citation count:
3,707
Year
Topic
Type