More efficient periodic traversal in anonymous undirected graphs (Q442265)

From MaRDI portal
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
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references