Randomized Parallel Algorithms for Matroid Union and Intersection, with Applications to Arborescences and Edge-Disjoint Spanning Trees
Copyright policy )Randomized Parallel Algorithms for Matroid Union and Intersection, with Applications to Arborescences and Edge-Disjoint Spanning Trees
Randomized parallel algorithms are given for the union, intersection and matching problems of linearly representable matroids. The key tools are the linear algebra reformulation of these problems (using matrices with indeterminates) due to Edmonds and Lovász, respectively, and randomization (Schwartz, Mulmuley, U. V. Vazirani and V. V. Vazirani).
Randomized Algorithms, parallel algorithms, Combinatorics in computer science, Graph Algorithms, randomization, Combinatorial aspects of matroids and geometric lattices, arborescences, Matroids, edge-disjoint spanning trees, Parallel Algorithms, linearly representable matroids, Distributed algorithms, matroid union
Randomized Algorithms, parallel algorithms, Combinatorics in computer science, Graph Algorithms, randomization, Combinatorial aspects of matroids and geometric lattices, arborescences, Matroids, edge-disjoint spanning trees, Parallel Algorithms, linearly representable matroids, Distributed algorithms, matroid union
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).21 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!