An O˜ (m2n) Algorithm for Minimum Cycle Basis of Graphs

Kavitha, Telikepalli; Mehlhorn, Kurt; Michail, Dimitrios; Paluch, Katarzyna E.

doi:10.1007/s00453-007-9064-z

Local TagsRelease HistoryDetailsSummary

An O˜ (m2n) Algorithm for Minimum Cycle Basis of Graphs

Kavitha, T., Mehlhorn, K., Michail, D., & Paluch, K. E. (2008). An O˜ (m2n) Algorithm for Minimum Cycle Basis of Graphs. Algorithmica, 52(3), 333-349. doi:10.1007/s00453-007-9064-z.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-1AEB-D Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0028-4ED4-D

Genre: Journal Article

Files

show Files

Locators

show

Creators

show

hide

Creators:
Kavitha, Telikepalli¹, Author
Mehlhorn, Kurt², Author
Michail, Dimitrios², Author
Paluch, Katarzyna E.¹, Author

Affiliations:
1External Organizations, ou_persistent22
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

Details

show

hide

Language(s): eng - English

Dates: Modified: 2009-03-13Published Online: 2008Date issued: 2008

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: Peer

Identifiers: eDoc: 428121
DOI: 10.1007/s00453-007-9064-z
Other: Local-ID: C125756E0038A185-7AA9BDC617A56BE7C125757800420759-Kavitha2008

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: Algorithmica

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: New York : Springer

Pages: - Volume / Issue: 52 (3) Sequence Number: - Start / End Page: 333 - 349 Identifier: ISSN: 0178-4617
CoNE: https://pure.mpg.de/cone/journals/resource/954925487793