### 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 |

Volume | 1 |

ISBN (Print) | 0780300335 |

Publication status | Published - 1991 Jan 1 |

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

### Other

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

City | Williamsburg, VA, USA |

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

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Electrical and Electronic Engineering

### Cite this

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

}

*Conference Proceedings - IEEE SOUTHEASTCON.*vol. 1, Publ by IEEE, pp. 579-581, IEEE Proceedings of the SOUTHEASTCON '91, Williamsburg, VA, USA, 91/4/8.

**Simple randomized parallel algorithms for finding a maximal matching in an undirected graph.** / Yang, S. B.; Dhall, S. K.; Lakshmivarahan, S.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Simple randomized parallel algorithms for finding a maximal matching in an undirected graph

AU - Yang, S. B.

AU - Dhall, S. K.

AU - Lakshmivarahan, S.

PY - 1991/1/1

Y1 - 1991/1/1

N2 - 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(log2 m) time, but it requires only m/log m processors.

AB - 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(log2 m) time, but it requires only m/log m processors.

UR - http://www.scopus.com/inward/record.url?scp=0025798262&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0025798262&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0025798262

SN - 0780300335

VL - 1

SP - 579

EP - 581

BT - Conference Proceedings - IEEE SOUTHEASTCON

PB - Publ by IEEE

ER -