Efficient exploration of anonymous undirected graphs (Q2870012)
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 6247313
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient exploration of anonymous undirected graphs |
scientific article; zbMATH DE number 6247313 |
Statements
Efficient Exploration of Anonymous Undirected Graphs (English)
0 references
17 January 2014
0 references
0.8273730278015137
0 references
0.823988676071167
0 references
0.8132632970809937
0 references
