English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time

MPS-Authors
/persons/resource/persons45750

Doerr,  Carola
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons118275

Schmidt,  Jens M.
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

Doerr, C., Schmidt, J. M., & Ramakrishna, G. (2013). Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time. In A. Brandstädt, K. Jansen, & R. Reischuk (Eds.), Graph-Theoretic Concepts in Computer Science (pp. 225-236). Berlin: Springer. doi:10.1007/978-3-642-45043-3_20.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0015-7946-D
Abstract
There is no abstract available