Sublinear-time algorithms for tournament graphs (Q652634)
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: Sublinear-time algorithms for tournament graphs |
scientific article; zbMATH DE number 5988541
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sublinear-time algorithms for tournament graphs |
scientific article; zbMATH DE number 5988541 |
Statements
Sublinear-time algorithms for tournament graphs (English)
0 references
15 December 2011
0 references
sublinear-time algorithms
0 references
tournament
0 references
random walk
0 references
0.9468393325805664
0 references
0.7658893465995789
0 references
0.7600917220115662
0 references
0.7600917220115662
0 references
0.7566103935241699
0 references
