How to meet when you forget: log-space rendezvous in arbitrary graphs (Q1938363)
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: How to meet when you forget: log-space rendezvous in arbitrary graphs |
scientific article; zbMATH DE number 6134269
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | How to meet when you forget: log-space rendezvous in arbitrary graphs |
scientific article; zbMATH DE number 6134269 |
Statements
How to meet when you forget: log-space rendezvous in arbitrary graphs (English)
0 references
4 February 2013
0 references
rendezvous
0 references
graph exploration
0 references
compact data structure
0 references
0 references
0 references
0 references
0.8465302
0 references
0 references
0 references
0.8422304
0 references
0.83550876
0 references
0.83285326
0 references
0 references
