An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs (Q1006382): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:57, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs |
scientific article |
Statements
An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs (English)
0 references
24 March 2009
0 references
Cycle basis
0 references
Cycle space
0 references
Matrix multiplication
0 references
Polynomial algorithms
0 references
