Different speeds suffice for rendezvous of two agents on arbitrary graphs (Q2971126)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6700297
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Different speeds suffice for rendezvous of two agents on arbitrary graphs |
scientific article; zbMATH DE number 6700297 |
Statements
Different Speeds Suffice for Rendezvous of Two Agents on Arbitrary Graphs (English)
0 references
4 April 2017
0 references
graph
0 references
mobile agents
0 references
rendezvous
0 references
speeds
0 references
universal exploration sequence
0 references
0.8593949675559998
0 references
0.8584786057472229
0 references
0.8500102162361145
0 references
0.8488224148750305
0 references
0.8457096815109253
0 references
