Faster Algorithms for Minimum Cycle Basis in Directed Graphs (Q3395038): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2144071845 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 22:53, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Faster Algorithms for Minimum Cycle Basis in Directed Graphs |
scientific article |
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
