Abstract
We consider the problem of maintaining a maximum matching in a convex bipartite graph G = (V,E) under a set of update operations which includes insertions and deletions of vertices and edges. It is not hard to show that it is impossible to maintain an explicit representation of a maximum matching in sub-linear time per operation, even in the amortized sense. Despite this difficulty, we develop a data structure which maintains the set of vertices that participate in a maximum matching in O(log2|V|) amortized time per update and reports the status of a vertex (matched or unmatched) in constant worst-case time. Our structure can report the mate of a matched vertex in the maximum matching in worst-case O( min { k log2|V| + log|V|, |V| log|V|}) time, where k is the number of update operations since the last query for the same pair of vertices was made. In addition, we give an \(O(\sqrt{|V|} \log^2{|V|})\)-time amortized bound for this pair query.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Berge, C.: Two theorems in graph theory. Proc. Nat. Acad. Sci. 43, 842–844 (1957)
Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation 9(3), 251–280 (1990)
Dekel, E., Sahni, S.: A parallel matching algorithm for convex bipartite graphs and applications to scheduling. Journal of Parallel and Distributed Computing 1, 185–205 (1984)
Gabow, H.N., Tarjan, R.E.: A linear-time algorithm for a special case of disjoint set union. Journal of Computer and System Sciences 30(2), 209–221 (1985)
Galil, Z.: Efficient algorithms for finding maximum matching in graphs. ACM Comput. Surv. 18(1), 23–38 (1986)
Gallo, G.: An O(nlogn) algorithm for the convex bipartite matching problem. Operations Research Letters 3(1), 31–34 (1984)
Glover, F.: Maximum matching in convex bipartite graphs. Naval Research Logistic Quarterly 14, 313–316 (1967)
Guibas, L., Sedgewick, R.: A dichromatic framework for balanced trees. In: Proc. 19th IEEE Symp. on Foundations of Computer Science, pp. 8–21 (1978)
Harvey, N.J.A.: Algebraic structures and algorithms for matching and matroid problems. In: Proc. 47th IEEE Symp. on Foundations of Computer Science, pp. 531–542 (2006)
Hopcroft, J.E., Karp, R.M.: An n 5/2 algorithm for maximum matchings in bipartite graphs. SIAM Journal on Computing 2(4), 225–231 (1973)
Lipski, W., Preparata, F.P.: Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems. Acta Informatica 15, 329–346 (1981)
Micali, S., Vazirani, V.: An \({O}(\sqrt{|V|}\cdot{|E|})\) algorithm for finding maximal matching in general graphs. In: Proc. 21st IEEE Symp. on Foundations of Computer Science, pp. 17–27 (1980)
Mucha, M., Sankowski, P.: Maximum matchings via gaussian elimination. In: Proc. 45th IEEE Symp. on Foundations of Computer Science, pp. 248–255 (2004)
Nievergelt, J., Reingold, E.M.: Binary search trees of bounded balance. In: Proc. 4th ACM Symp. on Theory of Computing, pp. 137–142 (1972)
Nievergelt, J., Wong, C.K.: Upper bounds for the total path length of binary trees. Journal of the ACM 20(1), 1–6 (1973)
Sankowski, P.: Dynamic transitive closure via dynamic matrix inverse. In: Proc. 45th IEEE Symp. on Foundations of Computer Science, pp. 509–517 (2004)
Sankowski, P.: Faster dynamic matchings and vertex connectivity. In: Proc. 18th ACM-SIAM Symp. on Discrete Algorithms, pp. 118–126 (2007)
Scutellà, M.G., Scevola, G.: A modification of Lipski-Preparata’s algorithm for the maximum matching problem on bipartite convex graphs. Ricerca Operativa 46, 63–77 (1988)
Steiner, G., Yeomans, J.S.: A linear time algorithm for determining maximum matchings in convex, bipartite graphs. Computers and Mathematics with Applications 31(12), 91–96 (1996)
van Emde Boas, P.: Preserving order in a forest in less than logarithmic time and linear space. Information Processing Letters 6(3), 80–82 (1977)
van Hoeve, W.-J.: The AllDifferent Constraint: A Survey. In: Proceedings of the Sixth Annual Workshop of the ERCIM Working Group on Constraints (2001)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brodal, G.S., Georgiadis, L., Hansen, K.A., Katriel, I. (2007). Dynamic Matchings in Convex Bipartite Graphs. In: Kučera, L., Kučera, A. (eds) Mathematical Foundations of Computer Science 2007. MFCS 2007. Lecture Notes in Computer Science, vol 4708. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74456-6_37
Download citation
DOI: https://doi.org/10.1007/978-3-540-74456-6_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74455-9
Online ISBN: 978-3-540-74456-6
eBook Packages: Computer ScienceComputer Science (R0)