Randomized Parallel Algorithms for Matroid Union and Intersection, with Applications to Arborescences and Edge-Disjoint Spanning Trees (Q4291564)
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 567053
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Randomized Parallel Algorithms for Matroid Union and Intersection, with Applications to Arborescences and Edge-Disjoint Spanning Trees |
scientific article; zbMATH DE number 567053 |
Statements
Randomized Parallel Algorithms for Matroid Union and Intersection, with Applications to Arborescences and Edge-Disjoint Spanning Trees (English)
0 references
5 September 1994
0 references
matroid union
0 references
arborescences
0 references
edge-disjoint spanning trees
0 references
parallel algorithms
0 references
linearly representable matroids
0 references
randomization
0 references
0.8164657354354858
0 references
0.8034154176712036
0 references
