Packing arborescences in random digraphs (Q1689982)
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 6827232
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Packing arborescences in random digraphs |
scientific article; zbMATH DE number 6827232 |
Statements
Packing arborescences in random digraphs (English)
0 references
18 January 2018
0 references
random graph
0 references
random digraph
0 references
edge disjoint spanning tree
0 references
spanning tree
0 references
packing arborescence
0 references
0 references
0 references
0.9989149570465088
0 references
0.807816207408905
0 references
0.8053843975067139
0 references
0.8037673830986023
0 references
0.8026313185691833
0 references
