English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Journal Article

Minimum Cycle Bases: Faster and Simpler

MPS-Authors
/persons/resource/persons45021

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

/persons/resource/persons45040

Michail,  Dimitrios
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Ressource
No external resources are shared
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Mehlhorn, K., & Michail, D. (2009). Minimum Cycle Bases: Faster and Simpler. ACM Transactions on Algorithms, 6(1), 8:1-8:13. doi:10.1145/1644015.1644023.


Cite as: http://hdl.handle.net/11858/00-001M-0000-000F-187C-6
Abstract
There is no abstract available