FAW 2014: Frontiers in Algorithmics pp 330-342 | Cite as
Dynamic Matchings in Left Weighted Convex Bipartite Graphs
Abstract
We consider the problem which is dynamically maintaining a maximum weight matching in a left weighted convex bipartite graph G = (V,E), V = X ∪ Y, in which each x ∈ X has an associated weight, and neighbors of each x ∈ X form an interval in the ordered Y set. The maintenance includes update operations (vertices and edges insertions and deletions) and query operations (inquiries of a vertex matching information). We reduce this problem to the corresponding unweighted problem and design an algorithm that maintains the update operations in O(log3|V|) amortized time per update. In addition, we develop a data structure to obtain the matching status of a vertex (whether it is matched) in constant worst-case time, and find the pair of a matched vertex (with which it is matched) in worst-case O(k) time, where k is not greater than the cardinality of the maximum weight matching.
Keywords
Dynamic Matching Weighted Convex Bipartite Graph Matroid BST Implicit RepresentationPreview
Unable to display preview. Download preview PDF.
References
- 1.Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley (1974)Google Scholar
- 2.Berge, C.: Two theorems in graph theory. Proceedings of the National Academy of Sciences of the United States of America 43(9), 842–844 (1957)CrossRefMATHMathSciNetGoogle Scholar
- 3.Brodal, G.S., Georgiadis, L., Hansen, K.A., Katriel, I.: Dynamic matchings in convex bipartite graphs. In: Kučera, L., Kučera, A. (eds.) MFCS 2007. LNCS, vol. 4708, pp. 406–417. Springer, Heidelberg (2007)CrossRefGoogle Scholar
- 4.Dekel, E., Sahni, S.: A parallel matching algorithm for convex bipartite graphs and applications to scheduling. Journal of Parallel and Distributed Computing 1(2), 185–205 (1984)CrossRefGoogle Scholar
- 5.Gabow, H.N., Tarjan, R.E.: A linear-time algorithm for a special case of disjoint set union. J. Comput. Syst. Sci. 30(2), 209–221 (1985)CrossRefMATHMathSciNetGoogle Scholar
- 6.Gale, D.: Optimal assignments in an ordered set: An application of matroid theory. Journal of Combinatorial Theory 4(2), 176–180 (1968)CrossRefMATHMathSciNetGoogle Scholar
- 7.Glover, F.: Maximum matching in a convex bipartite graph. Naval Research Logistics Quarterly 14(3), 313–316 (1967)CrossRefMATHGoogle Scholar
- 8.Katriel, I.: Matchings in node-weighted convex bipartite graphs. INFORMS Journal on Computing 20(2), 205–211 (2008)CrossRefMATHMathSciNetGoogle Scholar
- 9.Lipski Jr., W., Preparata, F.P.: Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems. Acta Inf. 15, 329–346 (1981)CrossRefMATHMathSciNetGoogle Scholar
- 10.Plaxton, C.G.: Fast scheduling of weighted unit jobs with release times and deadlines. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 222–233. Springer, Heidelberg (2008)CrossRefGoogle Scholar
- 11.Plaxton, C.G.: Vertex-weighted matching in two-directional orthogonal ray graphs. In: Cai, L., Cheng, S.-W., Lam, T.-W. (eds.) ISAAC 2013. LNCS, vol. 8283, pp. 524–534. Springer, Heidelberg (2013)CrossRefGoogle Scholar
- 12.Song, Y., Liu, T., Xu, K.: Independent domination on tree convex bipartite graphs. In: Snoeyink, J., Lu, P., Su, K., Wang, L. (eds.) AAIM 2012 and FAW 2012. LNCS, vol. 7285, pp. 129–138. Springer, Heidelberg (2012)CrossRefGoogle Scholar
- 13.Spencer, T.H., Mayr, E.W.: Node weighted matching. In: Paredaens, J. (ed.) ICALP 1984. LNCS, vol. 172, pp. 454–464. Springer, Heidelberg (1984)CrossRefGoogle Scholar
- 14.Steiner, G., Yeomans, J.S.: A linear time algorithm for maximum matchings in convex, bipartite graphs. Computers and Mathematics with Applications 31(12), 91–96 (1996)CrossRefMATHMathSciNetGoogle Scholar
- 15.Tarjan, R.E.: Efficiency of a good but not linear set union algorithm. J. ACM 22(2), 215–225 (1975)CrossRefMATHMathSciNetGoogle Scholar