Abstract
The perfect matching problem for general graphs reduces to the same for regular graphs. Even finding an NC algorithm for the perfect matching problem in cubic (3-regular) or 4-regular graphs will suffice to solve the general problem (see [DK 92]). For regular bipartite graphs an NC algorithm is already known [LPV 81], while [SW 96] give an NC algorithm for cubic-bipartite graphs.
We present a new and conceptually simple parallel algorithm for finding a perfect matching in d-regular bipartite graphs. When d is small (polylogarithmic) our algorithm in fact runs in NC. In particular for cubic-bipartite graphs, our algorithm as well as its analysis become much simpler than the previously known algorithms for the same. Our techniques are completely different from theirs.
Interestingly, our algorithm is based on a method used by [MV 00] for finding a perfect matching in planar-bipartite graphs. So, it is remarkable that, circumventing the planarity, we could still make the same approach work for a non-planar subclass of biparitite graphs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Dahlhouse, E., Karpinski, M.: Perfect matching for regular graphs is AC 0-hard for the general matching problem. J. Comput. Syst. Sci. 44, 94–102 (1992)
Grigoriev, D., Karpinski, M.: The matching problem for bipartite graphs with polynomially bounded permanent is in NC. In: Proceedings of 28th IEEE Conference on Foundations of Computer Science, pp. 166–172. IEEE Computer Society Press, Los Alamitos (1987)
Kulkarni, R., Mahajan, M.: Seeking a vertex of the planar matching polytope in NC. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol. 3221, pp. 472–483. Springer, Heidelberg (2004)
Karpinski, M., Rytter, W.: Fast parallel algorithms for graph matching problems. Oxford Science Publications (1998)
Karp, R., Upful, E., Wigderson, A.: Constructing a perfect matching is in random NC. Combinatorica 6, 35–48 (1986)
Lovasz, Plummer: Matching theory. Mathematical Studies, Annals of Discrete Maths, vol. 25. North-Holland, Amsterdam (1986)
Lev, G., Pippenger, M., Valiant, L.: A fast parallel algorithm for routing in permutation networks. IEEE Transactions on Computers C-30, 93–100 (1981)
Milller, G., Naor, J.: Flow in planar graphs with multiple sources and sinks. SIAM Journal of Computing 24, 1002–1017 (1995)
Mahajan, M., Varadarajan, K.: A new NC algorithm to find a perfect matching in planar and bounded genus graphs. In: Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing (STOC), pp. 351–357 (2000)
Mulmuley, K., Vazirani, U., Vazirani, V.: Matching is as easy as matrix inversion. Combinatorica 7(1), 105–131 (1987)
Schrijver, A.: Bipartite Edge Coloring in O(Delta m) Time. SIAM J. Comput. 28(3), 841–846 (1998)
Sharan, R., Wigderson, A.: A new NC algorithm for perfect matching in cubic bipartite graphs. In: Proc. of ISTCS 1996, pp. 56–65 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kulkarni, R. (2006). A New NC-Algorithm for Finding a Perfect Matching in d-Regular Bipartite Graphs When d Is Small. In: Calamoneri, T., Finocchi, I., Italiano, G.F. (eds) Algorithms and Complexity. CIAC 2006. Lecture Notes in Computer Science, vol 3998. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11758471_30
Download citation
DOI: https://doi.org/10.1007/11758471_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34375-2
Online ISBN: 978-3-540-34378-3
eBook Packages: Computer ScienceComputer Science (R0)