You are in : Home » Results & submissions » Select UOA » 11 - Computer Science and Informatics » View submission: University of Liverpool » Outputs » Detail

Output details

11 - Computer Science and Informatics

University of Liverpool

Return to search Previous output Next output

Output 0 of 0 in the submission

Article title

Fast periodic graph exploration with constant memory

Type

D - Journal article

DOI

10.1016/j.jcss.2007.09.004

Title of journal

Journal of Computer and System Sciences

Article number

Volume number

Issue number

First page of article

808

ISSN of journal

00220000

Year of publication

2008

URL

Number of additional authors

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

Proposed double-weighted

Double-weighted statement

Reserve for a double-weighted output

Non-English

English abstract