Efficient Algorithms for Finding Maximal Matching in Graphs

Authors:
Zvi Galil
Affiliations:
-
Venue:
CAAP '83 Proceedings of the 8th Colloquium on Trees in Algebra and Programming
Year:
1983

Citing 0
Cited 3

Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference

Theoretical Computer Science
The uniquely solvable bipartite matching problem

Operations Research Letters
Analysis and evaluation of the slugging form of ridesharing

Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract