An efficient parallel algorithm for maximum matching for some classes of graphs

Authors:
I. Parfenoff
Affiliations:
-
Venue:
Journal of Parallel and Distributed Computing
Year:
1998

Citing 0
Cited 3

A new NC-algorithm for finding a perfect matching in bipartite planar and small genus graphs (extended abstract)

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
An optimal parallel solution for the path cover problem on P4-sparse graphs

Journal of Parallel and Distributed Computing
Real-time minimum vertex cover for two-terminal series-parallel graphs

International Journal of High Performance Computing and Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract