More Efficient Periodic Traversal in Anonymous Undirected Graphs (Q3408168)

From MaRDI portal
Revision as of 18:19, 13 February 2024 by RedirectionBot (talk | contribs) (‎Changed an Item)
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
    24 February 2010
    0 references
    0 references