Skip to main content
SpringerLink
Log in

A linear time algorithm for the maximum matching problem on cographs

  • Part I Computer Science
  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

In this paper, we develop a sequential algorithm for the maximum matching problem on cographs. The input is a parse tree of some cograph. The time complexity of our algorithm is linear.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. K. Abrahamson, N. Dadoun, D. G. Kirkpatrick, and T. Przytycka,A simple parallel tree contraction algorithm, Journal of Algorithms, vol. 10, (1989), 287–302.

    Google Scholar 

  2. G. S. Adhar and T. Peng,Parallel algorithms for path covering, Hamiltonian path, and Hamiltonian cycle in cographs, Proc. International Conference on Parallel Processing, (1990), III364–III365.

  3. H. Alt, N. Blum, K. Mehlhorn, and M. Paul,Computing a maximum cardinality matching in a bipartite graph in time O(n 1.5 √(m/logn)), Information Processing Letters, vol. 37, (1991), 237–240.

    Google Scholar 

  4. D. G. Corneil, H. Lerchs, and L. S. Burlingham,Complement reducible graphs, Discrete Appl. Math., vol. 3, (1981), 163–174.

    Google Scholar 

  5. D. G. Corneil and Y. Perl,Clustering and domination in perfect graphs, Discrete Appl. Math., vol. 9, (1984), 27–39.

    Google Scholar 

  6. D. G. Corneil, Y. Perl, and L. K. Stewart,Cographs recognition, applications, and algorithms, Proceedings 15th Southeastern Conference on Combinatorics, Graph Theory and Computing, (1984).

  7. S. Even and O. Kariv,An O(n 2.5)algorithm for matching in general graphs, Proc. 16th IEEE Symposium on Foundations of Computer Science, Berkeley, California, (1975), 100–112.

  8. D. Knuth,The Art of Computer Programming, Vol. 1.Fundamental Algorithms, Addison-Wesley, Reading, MA, (1968).

    Google Scholar 

  9. A. Moitra and R. C. Johnson,A parallel algorithm for maximum matching in interval graphs, Proc. International Conference on Parallel Processing, (1989), III114–III120.

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics, National Chung-Hsing University, 40227, Taichung, Taiwan

    Ming-Shing Yu & Cheng-Hsing Yang

Authors
  1. Ming-Shing Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Cheng-Hsing Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Supported by National Science Council of Taiwan, R.O.C. under Grant NSC81-0415-E-005-03.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yu, MS., Yang, CH. A linear time algorithm for the maximum matching problem on cographs. BIT 33, 420–432 (1993). https://doi.org/10.1007/BF01990526

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01990526

CR categories

Keywords

Search

Navigation