More efficient periodic traversal in anonymous undirected graphs (Q442265): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q243587
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 01:16, 5 March 2024

scientific article
Language Label Description Also known as
English
More efficient periodic traversal in anonymous undirected graphs
scientific article

    Statements

    More efficient periodic traversal in anonymous undirected graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    10 August 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    algorithms and data structures
    0 references
    graph exploration
    0 references
    periodic graph traversal
    0 references
    oblivious agent
    0 references
    constant-memory agent
    0 references
    three-layer partition
    0 references