How to meet when you forget: log-space rendezvous in arbitrary graphs (Q1938363): Difference between revisions
From MaRDI portal
Latest revision as of 03:48, 6 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | How to meet when you forget: log-space rendezvous in arbitrary graphs |
scientific article |
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