Faster Algorithms for Minimum Cycle Basis in Directed Graphs (Q3395038)
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 5597435
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Faster Algorithms for Minimum Cycle Basis in Directed Graphs |
scientific article; zbMATH DE number 5597435 |
Statements
Faster Algorithms for Minimum Cycle Basis in Directed Graphs (English)
0 references
20 August 2009
0 references
cycle basis
0 references
fast matrix multiplication
0 references
randomization
0 references
shortest paths
0 references
0.9664413928985596
0 references
0.965010941028595
0 references
0.9511812329292296
0 references
0.9167856574058532
0 references
0.9140702486038208
0 references
