Reconstructing edge-disjoint paths faster (Q1785736)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6945849
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Reconstructing edge-disjoint paths faster |
scientific article; zbMATH DE number 6945849 |
Statements
Reconstructing edge-disjoint paths faster (English)
0 references
1 October 2018
0 references
ancestor tree
0 references
connectivity
0 references
edge-disjoint paths
0 references
0 references
0 references
0.8560931086540222
0 references
0.7968255877494812
0 references
0.7748808264732361
0 references
0.7632012367248535
0 references
