Schoppmeyer, Andreas2006-12-072006-12-072006http://hdl.handle.net/2003/2311710.17877/DE290R-3076The problem of finding a maximum-size matching in a graph appears in many situations in graph theory. Therefore it is crucial to compute such matchings in a fast way. In some cases a hybrid algorithm, consisting of an heuristic to find a start-matching and an exact algorithm to compute the maximum-size matching, appears to be much faster than classical algorithms. We show a way to implement appropriate heuristics, exact algorithms and hybrid algorithms in C++ and compare their performance on different random graphs. To reduce the programming-effort , we used comprehensible techniques. These techniques can be implemented indepen- dent of programming languages and the operating systems.enUniversität Dortmund, Wirtschafts- und Sozialwissenschaftliche FakultätDiskussionsbeiträge des Fachgebietes Operations Research und Wirtschaftsinformatik;32 (2006)Efficient graph algoritmsMaximun-size matchings330working paper