More efficient periodic traversal in anonymous undirected graphs (Q442265): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / author | |||
| Property / author: Wing-Kin Sung / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68R10 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68P05 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q25 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68T42 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C85 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6064610 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
algorithms and data structures | |||
| Property / zbMATH Keywords: algorithms and data structures / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
graph exploration | |||
| Property / zbMATH Keywords: graph exploration / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
periodic graph traversal | |||
| Property / zbMATH Keywords: periodic graph traversal / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
oblivious agent | |||
| Property / zbMATH Keywords: oblivious agent / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
constant-memory agent | |||
| Property / zbMATH Keywords: constant-memory agent / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
three-layer partition | |||
| Property / zbMATH Keywords: three-layer partition / rank | |||
Normal rank | |||
Revision as of 02:20, 30 June 2023
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
