English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Journal Article

Faster Algorithms for Minimum Cycle Basis in Directed Graphs

MPS-Authors
/persons/resource/persons44586

Hariharan,  Ramesh
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45021

Mehlhorn,  Kurt
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

Hariharan, R., Kavitha, T., & Mehlhorn, K. (2008). Faster Algorithms for Minimum Cycle Basis in Directed Graphs. SIAM Journal on Computing, 38(4), 1430-1447. doi:10.1137/060670730.


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