More efficient periodic traversal in anonymous undirected graphs (Q442265)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: More efficient periodic traversal in anonymous undirected graphs |
scientific article; zbMATH DE number 6064610
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | More efficient periodic traversal in anonymous undirected graphs |
scientific article; zbMATH DE number 6064610 |
Statements
More efficient periodic traversal in anonymous undirected graphs (English)
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
0.9780232906341552
0 references
0.8949784636497498
0 references
0.8923522233963013
0 references
0.8449417352676392
0 references
0.8441439867019653
0 references
