More efficient periodic traversal in anonymous undirected graphs (Q442265)

From MaRDI portal
Revision as of 15:54, 21 June 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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

    Identifiers