A probabilistic algorithm for vertex connectivity of graphs (Q1167545)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A probabilistic algorithm for vertex connectivity of graphs |
scientific article; zbMATH DE number 3772971
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A probabilistic algorithm for vertex connectivity of graphs |
scientific article; zbMATH DE number 3772971 |
Statements
A probabilistic algorithm for vertex connectivity of graphs (English)
0 references
1982
0 references
sparse graphs
0 references
network flow
0 references
complexity
0 references
0.90894365
0 references
0 references
0.90255785
0 references
0 references
