Graph search algorithms and maximum bipartite matching algorithm on the hypercube network model

Jang-Ping Sheu; Nan-Ling Kuo; Gen-Huey Chen

doi:10.1016/0167-8191(90)90151-X

Back

Graph search algorithms and maximum bipartite matching algorithm on the hypercube network model

Journal article

Peer reviewed

Graph search algorithms and maximum bipartite matching algorithm on the hypercube network model

Jang-Ping Sheu, Nan-Ling Kuo and Gen-Huey Chen

Parallel Computing, Vol.13(2), pp.245-251

1990

DOI: https://doi.org/10.1016/0167-8191(90)90151-X

Abstract

bipartite graph

breadth-first search

depth-first search

hypercube

Maximum matching

parallel algorithm

In this paper, we propose parallel algorithms for breadth-first search and depth-first search on the hypercube network model. In addition, a parallel algorithm based on the same model for finding maximum matching in bipartite graphs is proposed. © 1990.

Metrics

1 Record Views

Details

Title: Graph search algorithms and maximum bipartite matching algorithm on the hypercube network model
Creators - without role: Jang-Ping Sheu - Department of Electrical Engineering, National Central University
Nan-Ling Kuo - Tatung University
Gen-Huey Chen - National Taiwan University
Publication Details: Parallel Computing, Vol.13(2), pp.245-251
Identifiers: 9957774368506774
Academic Unit: Institute of Communications Engineering, College of Electrical Engineering and Computer Science, National Tsing Hua University
Language: English
Resource Type: Journal article

Graph search algorithms and maximum bipartite matching algorithm on the hypercube network model

Abstract

Related links

Metrics

Details

National Tsing Hua University Social media