More Efficient Periodic Traversal in Anonymous Undirected Graphs (Q3408168)

From MaRDI portal
Revision as of 20:53, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
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
    0 references