Optimal Construction of Edge-Disjoint Paths in Random Graphs (Q4210165)
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: Optimal Construction of Edge-Disjoint Paths in Random Graphs |
scientific article; zbMATH DE number 1200804
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal Construction of Edge-Disjoint Paths in Random Graphs |
scientific article; zbMATH DE number 1200804 |
Statements
Optimal Construction of Edge-Disjoint Paths in Random Graphs (English)
0 references
21 September 1998
0 references
edge-disjoint paths
0 references
random graph
0 references
eigenvalues
0 references
polynomial-time randomized algorithm
0 references
0 references
0 references
0.897765576839447
0 references
