More efficient periodic traversal in anonymous undirected graphs (Q442265): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2012.01.035 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2174851824 / rank | |||
Normal rank | |||
Revision as of 03:31, 20 March 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
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
