Fine-grained complexity for sparse graphs (Q5230293)
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 7097000
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fine-grained complexity for sparse graphs |
scientific article; zbMATH DE number 7097000 |
Statements
Fine-grained complexity for sparse graphs (English)
0 references
22 August 2019
0 references
fine-grained reductions
0 references
graph algorithms
0 references
minimum weight cycle
0 references
sparse graphs
0 references
0.89848936
0 references
0 references
0.8933923
0 references
0.8933923
0 references
0.89267045
0 references
0.8916509
0 references
0.89042974
0 references
0.8884065
0 references
0.8872825
0 references
