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

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Certifying 3-Edge-Connectivity

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/persons71827

Neumann,  Adrian
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

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

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

Mehlhorn, K., Neumann, A., & Schmidt, J. M. (2013). Certifying 3-Edge-Connectivity. In A. Brandstädt, K. Jansen, & R. Reischuk (Eds.), Graph-theoretic Concepts in Computer Science (pp. 358-369). Berlin: Springer. doi:10.1007/978-3-642-45043-3_31.


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