On the difficulty of finding walks of length k
RAIRO-Theor. Inf. Appl., 31 5 (1997) 429-435
Published online: 2017-02-01
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Fast Algorithms for Computing Fixed-Length Round Trips in Real-World Street Networks
Rhyd Lewis and Padraig CorcoranSN Computer Science 5 (7) (2024)
https://doi.org/10.1007/s42979-024-03223-3
Methods for determining cycles of a specific length in undirected graphs with edge weights
R. Lewis, P. Corcoran and A. GagarinJournal of Combinatorial Optimization 46 (5) (2023)
https://doi.org/10.1007/s10878-023-01091-w
Finding fixed-length circuits and cycles in undirected edge-weighted graphs: an application with street networks
R. Lewis and P. CorcoranJournal of Heuristics 28 (3) 259 (2022)
https://doi.org/10.1007/s10732-022-09493-5
Computational Logistics
Rhyd LewisLecture Notes in Computer Science, Computational Logistics 12433 384 (2020)
https://doi.org/10.1007/978-3-030-59747-4_25