Randomized Parallel Algorithms for Matroid Union and Intersection, with Applications to Arboresences and Edge-Disjoint Spanning Trees

Authors:
H. Narayanan;Huzur Saran;Vijay V. Vazirani
Affiliations:
-;-;-
Venue:
SIAM Journal on Computing
Year:
1994

Citing 0
Cited 4

Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size

APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Matroid matching: the power of local search

Proceedings of the forty-second ACM symposium on Theory of computing
Algebraic algorithms for linear matroid parity problems

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
A simple PTAS for weighted matroid matching on strongly base orderable matroids

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The strong link between matroids and matching is used to extend the ideas that resulted in the design of random $NC$ $(RNC)$ algorithms for matching to obtain $RNC$ algorithms for the matroid union, intersection, and matching problems, and for linearly representable matroids. As a consequence, $RNC$ algorithms for the well-known problems of finding an arboresence and a maximum cardinality set of edge-disjoint spanning trees in a graph are obtained. The key tools used are linear algebra and randomization.