Improved distance queries and cycle counting by Frobenius normal form (Q2321929)
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 7098518
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved distance queries and cycle counting by Frobenius normal form |
scientific article; zbMATH DE number 7098518 |
Statements
Improved distance queries and cycle counting by Frobenius normal form (English)
0 references
27 August 2019
0 references
graph algorithms
0 references
Frobenius normal form
0 references
all-nodes shortest cycles
0 references
0 references
0 references
0 references
0.9825838208198548
0 references
0.7252104878425598
0 references
0.7206382751464844
0 references
0.7095163464546204
0 references
