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:
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Year:
1992

Citing 9
Cited 1

Parallel computation for well-endowed rings and space-bounded probabilistic machines

Information and Control
Constructing a perfect matching is in random NC

Combinatorica
Are search and decision programs computationally equivalent?

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Matching is as easy as matrix inversion

Combinatorica
Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
The complexity of circuit value and network stability

Journal of Computer and System Sciences
Fast Probabilistic Algorithms for Verification of Polynomial Identities

Journal of the ACM (JACM)
Probabilistic algorithms for sparse polynomials

EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation
A Survey of Parallel Algorithms for Shared-Memory Machines

A Survey of Parallel Algorithms for Shared-Memory Machines

Randomness-optimal unique element isolation, with applications to perfect matching and related problems

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing

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 algorithms for matching to obtain RNC algorithms for the well-known problems of finding an arboresence and a maximum cardinality set of edge-disjoint spanning trees in a graph. The key tools used are linear algebra and randomization.