The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

Efficient approximation algorithms for shortest cycles in undirected graphs

På svenska

Author

Department/s

  • Computer Science

Publishing year

2009

Language

English

Pages

493-498

Publication/Series

Information Processing Letters

Volume

109

Issue

10

Document type

Journal article

Publisher

Elsevier

Topic

  • Computer Science

Status

Published

Project

  • VR 2008-4649

ISBN/ISSN/Other

  • ISSN: 0020-0190