### Abstract

The authors present simple randomized parallel algorithms for finding a maximal matching in a unidirectional graph G = (V, E) for the CRCW and CREW models. The algorithm for the CRCW model has O(log m) expected running time using m processors, where m is the number of edges in G. It is also shown that the CRCW algorithm can be implemented on a CREW PRAM (parallel random access machine). The CREW algorithm runs in O(log^{2} m) time, but it requires only m/log m processors.

Original language | English |
---|---|

Title of host publication | Conference Proceedings - IEEE SOUTHEASTCON |

Publisher | Publ by IEEE |

Pages | 579-581 |

Number of pages | 3 |

ISBN (Print) | 0780300335 |

Publication status | Published - 1991 |

Event | IEEE Proceedings of the SOUTHEASTCON '91 - Williamsburg, VA, USA Duration: 1991 Apr 8 → 1991 Apr 10 |

### Publication series

Name | Conference Proceedings - IEEE SOUTHEASTCON |
---|---|

Volume | 1 |

ISSN (Print) | 0734-7502 |

### Other

Other | IEEE Proceedings of the SOUTHEASTCON '91 |
---|---|

City | Williamsburg, VA, USA |

Period | 91/4/8 → 91/4/10 |

### All Science Journal Classification (ASJC) codes

- Electrical and Electronic Engineering

## Fingerprint Dive into the research topics of 'Simple randomized parallel algorithms for finding a maximal matching in an undirected graph'. Together they form a unique fingerprint.

## Cite this

Yang, S. B., Dhall, S. K., & Lakshmivarahan, S. (1991). Simple randomized parallel algorithms for finding a maximal matching in an undirected graph. In

*Conference Proceedings - IEEE SOUTHEASTCON*(pp. 579-581). (Conference Proceedings - IEEE SOUTHEASTCON; Vol. 1). Publ by IEEE.