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

Item

ITEM ACTIONSEXPORT

Released

Journal Article

A Probabilistic Algorithm for Vertex Connectivity of Graphs

MPS-Authors

Becker,  Michael
Max Planck Society;

Degenhardt,  W.
Max Planck Society;

Doenhardt,  J.
Max Planck Society;

Hertel,  S.
Max Planck Society;

Kaninke,  G.
Max Planck Society;

Kerber,  W.
Max Planck Society;

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

Näher,  Stefan
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Rohnert,  H.
Max Planck Society;

Winter,  T.
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

Becker, M., Degenhardt, W., Doenhardt, J., Hertel, S., Kaninke, G., Kerber, W., et al. (1982). A Probabilistic Algorithm for Vertex Connectivity of Graphs. Information Processing Letters, 15, 135-136.


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