Constructing a perfect matching is in random NC
- 135 Downloads
Constructing a perfect matching of maximum weight in a graph whose edge weights are given in unary notation;
Constructing a maximum-cardinality matching;
Constructing a matching covering a set of vertices of maximum weight in a graph whose vertex weights are given in binary;
Constructing a maximums-t flow in a directed graph whose edge weights are given in unary.
AMS subject classification (1980)68 E 10
Unable to display preview. Download preview PDF.
- A. Borodin, J. von zur Gathen andJ. Hopcroft, Fast parallel matrix and GCD computations.Proc. 23 STOC (1982), 65–71.Google Scholar
- H. J. Karloff, A Las Vegas RNC algorithm for maximum matchingCombinatorica, to appear.Google Scholar
- R. M. Karp, E. Upfal andA. Wigderson, Are search and decision problems computationally equivalent?STOC 1985.Google Scholar
- D. Kozen, U. V. Vazirani andV. V. Vazirani, The two-processors scheduling problem is in R-NC.STOC 1985.Google Scholar
- L. Lovász, Determinants, matchings and random algorithms,in: Fundamentals of Computation Theory, FCT’79. (ed. L. Budach), Akademie-Verlag Berlin 1979, pp 565–574.Google Scholar
- M. O. Rabin andV. V. Vazirani, Maximum matchings in general graphs through randomization, TR-15-84,Harvard University Center for Research in Computing Technology, 1984.Google Scholar
- E. Shamir andE. Upfal,N-processors graphs distributively achieve perfect matching inO(log2 N) beats.Proceeding of the First ACM SIGACT-SIGMOD Symp. on Principles of Distributed Computing. Ottawa, 1982, 238–241.Google Scholar
- D. J. A. Welsh,Matroid Theory. Academic Press (1976).Google Scholar