Expected complexity of routing in \(\Theta_6\) and half-\(\Theta_6\) graphs (Q5120153)
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 7245479
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Expected complexity of routing in \(\Theta_6\) and half-\(\Theta_6\) graphs |
scientific article; zbMATH DE number 7245479 |
Statements
9 September 2020
0 references
Expected Complexity of Routing in $\Theta_6$ and Half-$\Theta_6$ Graphs (English)
0 references
0.834763765335083
0 references
0.8111857771873474
0 references
0.7942614555358887
0 references
0.7935918569564819
0 references
0.7890563607215881
0 references
