An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs (Q1006382): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 02:53, 5 March 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
