Skip to main content

Computing Maximum Non-crossing Matching in Convex Bipartite Graphs

  • Conference paper

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

Abstract

We consider computing a maximum non-crossing matching in convex bipartite graphs. For a convex bipartite graph of n vertices and m edges, we present an O(nlogn) time algorithm for finding a maximum non-crossing matching in the graph. The previous best algorithm for this problem takes O(m + nlogn) time. Since m = Θ(n 2) in the worst case, our result improves the previous solution for large m.

Keywords

  • Bipartite Graph
  • Incident Edge
  • Binary Search Tree
  • Search Operation
  • Left Child

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This research was supported in part by NSF under Grant CCF-0916606.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry — Algorithms and Applications, 3rd edn. Springer, Berlin (2008)

    MATH  Google Scholar 

  2. Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press (2001)

    Google Scholar 

  3. Edmonds, J.: Paths, trees and flowers. Canad J. Math. 17, 449–467 (1965)

    CrossRef  MathSciNet  MATH  Google Scholar 

  4. van Emde Boas, P., Kaas, R., Zijlstra, E.: Design and implementation of an efficient priority queue. Theory of Computing Systems 10(1), 99–127 (1977)

    MATH  Google Scholar 

  5. Even, S., Tarjan, R.: Network flow and testing graph connectivity. SIAM J. Comput. 4, 507–518 (1975)

    CrossRef  MathSciNet  MATH  Google Scholar 

  6. Fredman, M.: On computing the length of longest increasing subsequences. Discrete Mathematics 11(1), 29–35 (1975)

    CrossRef  MathSciNet  MATH  Google Scholar 

  7. Gabow, H., Tarjan, R.: A linear-time algorithm for a special case of disjoint set union. Journal of Computer and System Sciences 30, 209–221 (1985)

    CrossRef  MathSciNet  MATH  Google Scholar 

  8. Gabow, H.: An efficient implementation of Edmonds’ algorithm for maximum matching on graphs. Journal of the ACM 23, 221–234 (1976)

    CrossRef  MathSciNet  MATH  Google Scholar 

  9. Glover, F.: Maximum matching in a convex bipartite graph. Naval Res. Logist. Quart. 14, 313–316 (1967)

    CrossRef  MATH  Google Scholar 

  10. Hopcroft, J., Karp, R.: An n 5/2 algorithm for maximum matchings in bipartite graphs. SIAM J. on Comput. 2(4), 225–231 (1973)

    CrossRef  MathSciNet  MATH  Google Scholar 

  11. Lipski Jr., W., Preparata, F.P.: Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems. Acta Informatica 15(4), 329–346 (1981)

    CrossRef  MathSciNet  MATH  Google Scholar 

  12. Kajitami, Y., Takahashi, T.: The noncross matching and applications to the 3-side switch box routing in VLSI layout design. In: Proc. International Symposium on Circuits and Systems, pp. 776–779 (1986)

    Google Scholar 

  13. Kuhn, H.: The Hungarian method for the assignment problem. Naval Research Logistics Quarterly 2, 83–97 (1955)

    CrossRef  MathSciNet  Google Scholar 

  14. Liang, Y., Blum, N.: Circular convex bipartite graphs: Maximum matching and Hamiltonian circuits. Information Processing Letters 56, 215–219 (1995)

    CrossRef  MathSciNet  MATH  Google Scholar 

  15. Malucelli, F., Ottmann, T., Pretolani, D.: Efficient labelling algorithms for the maximum noncrossing matching problem. Discrete Applied Mathematics 47(2), 175–179 (1993)

    CrossRef  MathSciNet  MATH  Google Scholar 

  16. Micali, S., Vazirani, V.: An \(O(\sqrt{|V|} |E|)\) algorithm for finding maximum matching in general graphs. In: Proc. of the 21st Annual Symposium on Foundations of Computer Science, pp. 17–27 (1980)

    Google Scholar 

  17. Steiner, G., Yeomans, J.: A linear time algorithm for maximum matchings in convex, bipartite graphs. Computers and Mathematics with Applications 31(2), 91–96 (1996)

    CrossRef  MathSciNet  MATH  Google Scholar 

  18. Widmayer, P., Wong, C.: An optimal algorithm for the maximum alignment of terminals. Information Processing Letters 10, 75–82 (1985)

    CrossRef  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, D.Z., Liu, X., Wang, H. (2012). Computing Maximum Non-crossing Matching in Convex Bipartite Graphs. In: Snoeyink, J., Lu, P., Su, K., Wang, L. (eds) Frontiers in Algorithmics and Algorithmic Aspects in Information and Management. Lecture Notes in Computer Science, vol 7285. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29700-7_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29700-7_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29699-4

  • Online ISBN: 978-3-642-29700-7

  • eBook Packages: Computer ScienceComputer Science (R0)