A new approach to maximum matching in general graphs

Authors:
Norbert Blum
Affiliations:
-
Venue:
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Year:
1990

Citing 0
Cited 3

Clique partitions, graph compression and speeding-up algorithms

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Determinant algorithms for random planar structures

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
A Las Vegas O(n2.38 algorithm for the cardinality of a maximum matching

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract