Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs (Q5458575): 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.1007/978-3-540-78773-0_63 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1781409509 / rank | |||
Normal rank | |||
Revision as of 02:49, 20 March 2024
scientific article; zbMATH DE number 5263953
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs |
scientific article; zbMATH DE number 5263953 |
Statements
Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs (English)
0 references
15 April 2008
0 references
