Abstract
In this paper we devise randomized parallel algorithms which given a unary weighted (di)graphG=(V, E)construct in time O(log2¦ V¦) branchings, perfect matchings, and disjoint cycles of weightexactly k belonging toG. These problems have been studied by Papadimitriou and Yannakakis [PY1], by Barahona and Pulleyblank [BP], by Cameriniet al [CGM], and by Mulmuleyet al. [MVV]. Our algorithms improve previous solutions. Moreover, we give an NC2 algorithm for computing the absolute value of the pfaffian of a skew-symmetric matrix.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Barahona, F., and W. R. Pulleyblank, Exact arborescences, matchings and cycles,Discrete Appl. Math.,16 (1987), 91–99.
Borodin, A., S. A. Cook, and N. Pippenger, Parallel computation for well-endowed rings and space bounded probabilistic machines,Inform, and Control,58 (1983), 113–136.
Camerini, P. M., G. Galbriati, and F. Maffioli, Random pseudo-polynomial algorithms for exact matroid problem.J. Algorithms,13 (1992), 258–273.
Cook, S., A taxonomy of problems which have fast parallel algorithms,Inform, and Control,64 (1985), 2–22.
Edmonds, J., Optimum branchings,J. Res. Nat. Bur. Standards,71B (1967), 233–240.
Galbiati, G., and F. Maffioli, Constructing an exact parity base is in RNC2, Report No. 91-022, Dip. di Elettronica, Polit, di Milano, 1991.
Householder, A. S.,The Numerical Treatment of Single Nonlinear Equations, McGrawHill, New York, 1970.
Horowitz, E., and S. Sahni, On computing the exact determinant of matrices with polynomial entries,J. Assoc. Comput. Mack,22 (1975), 38–50.
Kirchhoff, G., Über die Ausflösung der Gleichungen auf welche man bei der Untersuchungen der Linearen Verteilung Galvanisher Ströme gefürt wird,Poggendorf Ann. Phys.,72 (1947), 497–508.
Karp, R. M., and V. Ramachandran, A survey of parallel algorithms for shared-memory machines, in: J. van Leeuwen, ed.,Handbook of Theoretical Computer Science, vol. A, North-Holland, Amsterdam, 1990, pp. 869–941.
Karp, R. M., E. Upfal, and A. Widgerson, The complexity of parallel search,J. Comput. System Sci.,36 (1988), 225–253.
Lovàsz, L., Computing ears and branchings in parallel,Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985, pp. 464–467.
Mulmuley, K., U. V. Vazirani, and V. V. Vazirani, Matching is as easy as matrix inversion,Combinatorica,7 (1987), 105–113.
Papadimitriou, C. H., and M. Yannakakis, The complexity of restricted spanning tree problems,J. Assoc. Comput. Mach.,29 (1982), 285–309.
Papadimitriou, C. H., and M. Yannakakis, The complexity of facets (and some facets of complexity),J. Comput. System Sci.,28 (1984), 244–259.
Schnorr, C., On self-transformable combinatorial problems,J. Assoc. Comput. Mach.,27 (1980), 701–717.
Tutte, W. T., The factorization of linear graphs,J. London Math. Soc.,22 (1947), 107–111.
Tutte, W. T.,Graph Theory, Addison-Wesley, Reading, MA, 1984.
Valiant, L. G., Relative complexity on checking and evaluating,Inform. Process. Lett.,5 (1976), 20–23.
Vazirani, V. V., NC algorithms for computing the number of perfect matchings in K3,3-free graphs and related problems,Inform. and Comput.,80 (1989), 152–163.
Wagner, K. W., More complicated questions about maxima and minima, and some closures of NP,Theoret. Comput. Sci.,51 (1987), 53–80.
Author information
Authors and Affiliations
Additional information
Communicated by C. H. Papadimitriou.
Supported in part by MURST 40%.
Rights and permissions
About this article
Cite this article
Bruschi, D., Ravasio, F. Random parallel algorithms for finding exact branchings, perfect matchings, and cycles. Algorithmica 13, 346–356 (1995). https://doi.org/10.1007/BF01293484
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01293484