Efficient approximation algorithms for shortest cycles in undirected graphs (Q987804): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2009.01.008 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2025590553 / rank | |||
Normal rank | |||
Revision as of 20:10, 19 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
