Skip to main content
SpringerLink
Log in

Unbalanced and Hierarchical Bipartite Matchings with Applications to Labeled Tree Comparison

  • Conference paper
  • First Online:
Algorithms and Computation (ISAAC 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1969))

Included in the following conference series:

  • 713 Accesses

Abstract

This paper is concerned with maximum weight matchings of bipartite graphs. We show how to speed up the existing matching algorithms when the input graphs are node unbalanced or weight unbalanced. Based on these improved matching algorithms, we can solve efficiently a new matching problem called the hierarchical bipartite matching problem, and thus obtain a simple and faster algoirthm for finding the maximum agreement subtree of two labeled trees. The significance of our subtree algorithm lies in the fact that it matches or outperforms all previously known subtree algorithms that were designed for two special cases of labeled trees, namely, uniformly labeled trees and evolutionary trees.

Research supported in part by NSF Grant CCR-9531028.

Research supported in part by Hong Kong RGC Grant HKU-7027/98E.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. R. K. Ahuja, J. B. Orlin, C. Stein, and R. E. Tarjan. Improved algorithms for bipartite network flow. SIAM Journal on Computing, 23(5):906–933, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  2. M. J. Chung. O(n 2.5) time algorithms for the subgraph homeomorphism problem on trees. Journal of Algorithms, 8:106–112, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  3. R. Cole, M. Farach, R. Hariharan, T. M. Przytycka, and M. Thorup. An O(n log n) time algorithm for the maximum agreement subtree problem for binary trees. SIAM Journal on Computing. To appear.

    Google Scholar 

  4. T. H. Cormen, C. L. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, Cambridge, MA, 1991.

    Google Scholar 

  5. M. Farach, T. M. Przytycka, and M. Thorup. Computing the agreement of trees with bounded degrees. In Lecture Notes in Computer Science 979: Proceedings of the 3rd Annual European Symposium on Algorithms, pages 381–393. 1995.

    Google Scholar 

  6. M. Farach and M. Thorup. Sparse dynamic programming for evolutionary-tree comparison. SIAM Journal on Computing, 26(1):210–230, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  7. C. R. Finden and A. D. Gordon. Obtaining common pruned trees. Journal of Classification, 2:255–276, 1985.

    Article  Google Scholar 

  8. J. Friedman. Expressing logical formulas in natural languages. In Formal methods in the study of language, pages 113–130. Mathematical Centre, Amsterdam, 1981.

    Google Scholar 

  9. H. N. Gabow and R. E. Tarjan. Faster scaling algorithms for network problems. SIAM Journal on Computing, 18(5):1013–1036, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  10. A. Gupta and N. Nishimura. Finding largest subtrees and smallest supertrees. Algorithmica, 21(2):183–210, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  11. D. Gusfield, C. Martel, and D. Fernández-Baca. Fast algorithms for bipartite network flow. SIAM Journal on Computing, 16:237–251, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  12. M. Y. Kao. Tree contractions and evolutionary trees. SIAM Journal on Computing, 27(6):1592–1616, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  13. M. Y. Kao, T. W. Lam, W. K. Sung, and H. F. Ting. A decomposition theorem for maximum weight bipartite matchings with applications to evolutionary trees. In Lecture Notes in Computer Science: Proceedings of the 8th Annual European Symposium on Algorithms, pages 438–449. 1999.

    Google Scholar 

  14. M. Y. Kao, T. W. Lam, W. K. Sung, and H. F. Ting. A faster and unifying algorithm for comparing trees. In Proceedings of the 11th Symposium on Combinatorial Pattern matching, 2000. To appear.

    Google Scholar 

  15. P. Kilpeläinen and H. Mannila. Grammatical tree matching. In Lecture Notes in Computer Science 644: Proceedings of the 3rd Annual Symposium on Combinatorial Pattern Matching, pages 162–174. 1992.

    Google Scholar 

  16. H. Mannila and K. J. Räihä. On query languages for the p-string data model. In Information Modelling and Knowledge Bases, pages 469–482. 1990.

    Google Scholar 

  17. P. Materna, P. Sgall, and Z. Hajicova. Linguistic constructions in transparent intensional logic. Prague Bulletin on Mathematical Linguistics, pages 27–32, 1985.

    Google Scholar 

  18. T. Przytycka. Sparse dynamic programming for maximum agreement subtree problem. In Mathematical Hierarchies and Biology, pages 249–264, 1997.

    Google Scholar 

  19. B. Shapiro and K. Zhang. Comparing multiple RNA secondary structures using tree comparisons. Computer Applications in Bioscience, pages 309–318, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Yale University, 06520, New Haven, CT, USA

    Ming-Yang Kao

  2. Department of Computer Science and Information Systems, University of HongKong, Hong Kong

    Tak-Wah Lam & Hing-Fung Ting

  3. E-Business Technology Institute, University of Hong Kong, Hong Kong

    Wing-Kin Sung

Authors
  1. Ming-Yang Kao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tak-Wah Lam
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wing-Kin Sung
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Hing-Fung Ting
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Karlsruhe University, Germany

    Gerhard Goos

  2. Cornell University, NY, USA

    Juris Hartmanis

  3. Utrecht University, The Netherlands

    Jan van Leeuwen

  4. Academia Sinica, Institute of Information Science, 128 Academia Road, Section 2, Nankang, 115, Taipei, Taiwan, R.O.C.

    D. T. Lee

  5. Department of Computer Science and Akamai Technologies, University of Illinois at Urbana Champaign, 500 Technology Square, 02139, Cambridge, MA, USA

    Shang-Hua Teng

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kao, MY., Lam, TW., Sung, WK., Ting, HF. (2000). Unbalanced and Hierarchical Bipartite Matchings with Applications to Labeled Tree Comparison. In: Goos, G., Hartmanis, J., van Leeuwen, J., Lee, D.T., Teng, SH. (eds) Algorithms and Computation. ISAAC 2000. Lecture Notes in Computer Science, vol 1969. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-40996-3_41

Download citation

  • DOI: https://doi.org/10.1007/3-540-40996-3_41

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41255-7

  • Online ISBN: 978-3-540-40996-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation