All-pairs 2-reachability in \(\mathcal{O}(n^\omega\log n)\) time (Q5111405)
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: All-pairs 2-reachability in O(n^ n) time |
scientific article; zbMATH DE number 7204526
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | All-pairs 2-reachability in \(\mathcal{O}(n^\omega\log n)\) time |
scientific article; zbMATH DE number 7204526 |
Statements
27 May 2020
0 references
2-reachability
0 references
all-dominator trees
0 references
directed graphs
0 references
Boolean matrix multiplication
0 references
All-Pairs 2-Reachability in O(n^w log n) Time (English)
0 references
0.834883451461792
0 references
0.8306484222412109
0 references
0.825472354888916
0 references
0.7762035131454468
0 references
0.774770200252533
0 references
