Efficient approximation algorithms for shortest cycles in undirected graphs (Q987804): 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:49, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient approximation algorithms for shortest cycles in undirected graphs |
scientific article |
Statements
Efficient approximation algorithms for shortest cycles in undirected graphs (English)
0 references
16 August 2010
0 references
graph algorithm
0 references
approximation algorithm
0 references
shortest cycle
0 references
undirected graph
0 references
time complexity
0 references
