Fast periodic graph exploration with constant memory (Q931724)

From MaRDI portal
Revision as of 12:45, 28 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Fast periodic graph exploration with constant memory
scientific article

    Statements

    Fast periodic graph exploration with constant memory (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    26 June 2008
    0 references
    0 references
    finite automaton
    0 references
    period
    0 references
    port number
    0 references
    penalty
    0 references
    full degree
    0 references
    0 references