Improved Distance Queries and Cycle Counting by Frobenius Normal Form (Q4636657)
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: Improved Distance Queries and Cycle Counting by Frobenius Normal Form |
scientific article; zbMATH DE number 6862148
| 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 6862148 |
Statements
19 April 2018
0 references
Frobenius normal form
0 references
graph algorithms
0 references
all-nodes shortest cycles
0 references
Improved Distance Queries and Cycle Counting by Frobenius Normal Form (English)
0 references
0.9999998
0 references
0.85157186
0 references
0.8437629
0 references
0.84226924
0 references
0.83712816
0 references
0.83248395
0 references
0.8280634
0 references
