Skip to main content
SpringerLink
Log in

An efficient parallel graph edge matching algorithm and its applications

  • Correspondence
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

A fast and efficient parallel algorithm for finding a maximal edge matching in an undirected graphG(V,E) is proposed. It runs inO(logn) time with (M/logn+n) processors on an EREW PRAM for a class of graph set II, wheren=|V|, m=|E| and II includes at least (i) planar graphs; (ii) graphs of bounded genus; and (iii) graphs of bounded maximum degree and so on. Our algorithm improves the previously known best algorithms by a factor of logn in the time complexity with linear number of processors on EREW PRAMs when the input is limited to II.

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. Goldberg A V, Plotkin S A. Sublinear-time parallel algorithms for matching and related problems.Journal of Algorithms, 1993, 14: 180–213.

    Article  MATH  MathSciNet  Google Scholar 

  2. Chen Z. A fast and efficient NC algorithm for maximal matching.Info. Proc. Letters, 1995, 55: 303–307.

    Article  MATH  Google Scholar 

  3. Han Y. An improvement on parallel computation of a maximal matching.Info. Proc. Letters, 1995, 56: 343–348.

    Article  MATH  Google Scholar 

  4. Iseaeli A, Shiloach Y. An improved parallel algorithm for maximal matching.Info. Proc. Letters, 1986, 22: 57–60.

    Article  Google Scholar 

  5. Iseaeli A, Itai A. A fast and simple randomized parallel algorithm for maximal matching.Info. Proc. Letters, 1986, 22: 77–80.

    Article  Google Scholar 

  6. Kelsen P. An optimal parallel algorithm for maximal matching.Info. Proc. Letters, 1994, 52: 223–228.

    Article  MATH  MathSciNet  Google Scholar 

  7. Harary F. Graph Theory, revised. Addison-Wesley, Reading, MA, 1972.

    Google Scholar 

  8. Chiba N, Nishizeki T. Arboricity and subgraph listing algorithms.SIAM J. Comput., 1978, 14(1): 210–223.

    Article  MathSciNet  Google Scholar 

  9. Jájá J. An Introduction to Parallel Algorithms. Addison-Wesley Publishing Company, 1992.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Shandong University, 250100, Jinan, P.R. China

    Ma Jun & Ma Shaohan

Authors
  1. Ma Jun
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ma Shaohan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ma Jun.

Additional information

This research was supported in part by the National “863” Hi-Tech Program of China, the NSF of China, the NSF of Shandong Province, the Foundation of the Fellowship for the 21st Century of Shandong University and the Foundation of JSPS of Japan. Some content of the paper was presented at the IASTED International Conference on Parallel and Distributed Computing and Systems, Oct. 1996, Chicago, Illinois, USA.

MA Jun received his B.S. degree from Shandong University of China in 1982, M.S. degree from Ibaraki University of Japan in 1988, and Ph.D. degree from Kyushu University of Japan in 1997, all in computer science. Now he is a Professor at the Computer Science Department of Shandong University. His research interests include design and analysis of algorithms, parallel and distributed processing, and AI.

MA Shaohan graduated from the Department of Math of Shandong University of China in 1962. He was a research fellow at the Illinois University from 1985 to 1986. Now he is a Professor and the Dean of the Computer Science Department of Shandong University. His research interests include design and analysis of algorithms, parallel and distributed algorithms, and AI.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ma, J., Ma, S. An efficient parallel graph edge matching algorithm and its applications. J. Comput. Sci. & Technol. 14, 153–158 (1999). https://doi.org/10.1007/BF02946522

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation