de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Journal Article

New Approximation Algorithms for Minimum Cycle Bases of Graphs

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons45021

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

http://pubman.mpdl.mpg.de/cone/persons/resource/persons45040

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

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Kavitha, T., Mehlhorn, K., & Michail, D. (2011). New Approximation Algorithms for Minimum Cycle Bases of Graphs. Algorithmica, 59(4), 471-488. doi:10.1007/s00453-009-9313-4.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0010-125C-A
Abstract
There is no abstract available