Home News About Us Contact Contributors Disclaimer Privacy Policy Help FAQ

Home
Search
Quick Search
Advanced
Fulltext
Browse
Collections
Persons
My eDoc
Session History
Login
Name:
Password:
Documentation
Help
Support Wiki
Direct access to
document ID:


          Display Documents



ID: 344645.0, MPI für Informatik / Algorithms and Complexity Group
A Probabilistic Algorithm for Vertex Connectivity of Graphs
Authors:Becker, Michael; Degenhardt, W.; Doenhardt, J.; Hertel, S.; Kaninke, G.; Kerber, W.; Mehlhorn, Kurt; Näher, Stefan; Rohnert, H.; Winter, T.
Language:English
Date of Publication (YYYY-MM-DD):1982
Title of Journal:Information Processing Letters
Volume:15
Start Page:135
End Page:136
Review Status:Peer-review
Audience:Experts Only
Intended Educational Use:No
Last Change of the Resource (YYYY-MM-DD):2008-03-06
External Publication Status:published
Document Type:Article
Communicated by:Kurt Mehlhorn
Affiliations:MPI für Informatik/Algorithms and Complexity Group
Identifiers:LOCALID:C1256428004B93B8-616C11FCA8416505C12571C2006662F6-...
ISSN:0020-0190
The scope and number of records on eDoc is subject to the collection policies defined by each institute - see "info" button in the collection browse view.