Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs (Q5458575): Difference between revisions
From MaRDI portal
Latest revision as of 21:23, 27 June 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