More Efficient Periodic Traversal in Anonymous Undirected Graphs (Q3408168): Difference between revisions
From MaRDI portal
Latest revision as of 12:20, 2 July 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
24 February 2010
0 references