Output details
11 - Computer Science and Informatics
University of Liverpool
Return to search
Output 0 of 0 in the submission
Article title
Fast periodic graph exploration with constant memory
Type
D - Journal article
Title of journal
Journal of Computer and System Sciences
Article number
-
Volume number
74
Issue number
5
First page of article
808
ISSN of journal
00220000
Year of publication
2008
URL
-
Number of additional authors
4
Additional information
<12> Our main result disproves a conjecture of Ilcinkas (SIROCCO 2006) on the upper bound of the length of a periodic graph traversal. Our paper is based on a SIROCCO 2007 paper; it was not returned in RAE-2008.
Interdisciplinary
-
Cross-referral requested
-
Research group
None
Citation count
11
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-