"A Probabilistic Algorithm for Vertex Connectivity of Graphs."

Michael Becker et al. (1982)

> Home

Details and statistics

DOI: 10.1016/0020-0190(82)90046-1

access: closed

type: Journal Article

metadata version: 2017-11-23

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ipl/BeckerDDHKKMNRW82
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/BeckerDDHKKMNRW82
Michael Becker, W. Degenhardt, Jürgen Doenhardt, Stefan Hertel, Gerd Kaninke, W. Kerber, Kurt Mehlhorn, Stefan Näher, Hans Rohnert, Thomas Winter:
A Probabilistic Algorithm for Vertex Connectivity of Graphs. Inf. Process. Lett. 15(3): 135-136 (1982)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.