Breaking the O(m^2n) Barrier for Minimum Cycle Bases

Amaldi, Edoardo; Iuliano, Claudio; Jurkiewicz, Tomasz; Mehlhorn, Kurt; Rizzi, Romeo

doi:10.1007/978-3-642-04128-0_28

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Breaking the O(m^2n) Barrier for Minimum Cycle Bases

MPS-Authors

/persons/resource/persons44713

Jurkiewicz, Tomasz
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45021

Mehlhorn, Kurt
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Amaldi, E., Iuliano, C., Jurkiewicz, T., Mehlhorn, K., & Rizzi, R. (2009). Breaking the O(m^2n) Barrier for Minimum Cycle Bases. In A. Fiat, & P. Sanders (Eds.), Algorithms - ESA 2009 (pp. 301-312). Berlin: Springer. doi:10.1007/978-3-642-04128-0_28.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0019-DA98-1

Abstract

There is no abstract available