Skip to main content
SpringerLink
Log in

Finding a maximum matching in a permutation graph

  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract

We present anO(n log logn) time algorithm for finding a maximum matching in a permutation graph withn vertices, assuming that the input graph is represented by a permutation.

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. C. Berge: Two theorems in graph theory. Proceeding of National Academy of Science43 (1957) 842–844

    Google Scholar 

  2. J. Edmonds: Paths, trees and flowers. Canadian J.17 (1965) 449–467

    Google Scholar 

  3. P. van Emde Boas: Preserving order in a forest in less than logarithmic time and linear space. Information Processing Letters6 (1977) 80–82

    Google Scholar 

  4. S. Even, O. Kariv: AnO(n 2.5) algorithm for finding maximum matching in general graphs. Proceeding of 16th IEEE Sympo. on Foundations of Computer Science (1975) 100–112

  5. H. Gabow: An efficient implementation of Edmonds' maximum matching algorithm. TR 31, Stan-CS (1972) 72–328

  6. M.C. Golumbic: Algorithmic graph theory and perfect graphs. Academic Press, New York, 1980

    Google Scholar 

  7. M.C. Hopcroft, R.M. Karp: AnO(n 2.5) algorithm for maximum matching in bipartite graphs. SIAM J. on Computing2 (1973) 225–231

    Google Scholar 

  8. V. Kamakoti, C. Pandu Rangan: Efficient transitive reduction on permutation graphs with applications. SCI J. of Computer Science and Informatics (INDIA, 1994)

  9. Y. Liang, C. Rhee: Finding a maximum matching in a circular-arc graph. Information Processing Letters45 (1993) 185–190

    Google Scholar 

  10. S. Micali, V. Vazirani: AnO(√nm) algorithm for finding maximum matching in general graphs. 21th Annual IEEE Sympo. on the Foundations of Software Technology and Theoretical Computer Science (1980)

  11. A. Pnueli, A. Lempel, S. Even: Transitive orientation of graphs and identification of permutation graphs. Can. J. Math.23 (1971) 160–175

    Google Scholar 

  12. J. Spinrad: On comparability and permutation graphs. SIAM J. Computing14 (1985) 658–670

    Google Scholar 

  13. M.S. Yu, C.H. Yang: AnO(n) time algorithm for maximum matching on cographs. Information Processing Letters47 (1993) 89–93

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Statistics and Computer Science, Eastern Kentucky University, 40475, Richmond, KY, USA

    Chongkye Rhee

  2. Department of Computer Science, Indiana Purdue University at Fort Wayne, 46805, IN, USA

    Y. Daniel Liang

Authors
  1. Chongkye Rhee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Y. Daniel Liang
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Rhee, C., Liang, Y.D. Finding a maximum matching in a permutation graph. Acta Informatica 32, 779–792 (1995). https://doi.org/10.1007/BF01178659

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation