Skip to main content
SpringerLink
Log in

Dynamic Matchings in Left Weighted Convex Bipartite Graphs

  • Conference paper
Frontiers in Algorithmics (FAW 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8497))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

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)

    Article  MATH  MathSciNet  Google 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)

    Chapter  Google 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)

    Article  Google 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)

    Article  MATH  MathSciNet  Google Scholar 

  6. Gale, D.: Optimal assignments in an ordered set: An application of matroid theory. Journal of Combinatorial Theory 4(2), 176–180 (1968)

    Article  MATH  MathSciNet  Google Scholar 

  7. Glover, F.: Maximum matching in a convex bipartite graph. Naval Research Logistics Quarterly 14(3), 313–316 (1967)

    Article  MATH  Google Scholar 

  8. Katriel, I.: Matchings in node-weighted convex bipartite graphs. INFORMS Journal on Computing 20(2), 205–211 (2008)

    Article  MATH  MathSciNet  Google 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)

    Article  MATH  MathSciNet  Google 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)

    Chapter  Google 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)

    Chapter  Google 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)

    Chapter  Google 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)

    Chapter  Google 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)

    Article  MATH  MathSciNet  Google Scholar 

  15. Tarjan, R.E.: Efficiency of a good but not linear set union algorithm. J. ACM 22(2), 215–225 (1975)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Software Engineering, Tongji University, Shanghai, China

    Quan Zu, Miaomiao Zhang & Bin Yu

Authors
  1. Quan Zu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Miaomiao Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Bin Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, Texas A&M University, USA

    Jianer Chen

  2. Cornell University, USA

    John E. Hopcroft

  3. School of Information Science and Engineering, Central South University, 410083, Changsha, China

    Jianxin Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Zu, Q., Zhang, M., Yu, B. (2014). Dynamic Matchings in Left Weighted Convex Bipartite Graphs. In: Chen, J., Hopcroft, J.E., Wang, J. (eds) Frontiers in Algorithmics. FAW 2014. Lecture Notes in Computer Science, vol 8497. Springer, Cham. https://doi.org/10.1007/978-3-319-08016-1_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-08016-1_30

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-08015-4

  • Online ISBN: 978-3-319-08016-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation