@MISC{Load_lydiaworkshop, author = {Hellas Load and Chair Christos Nikolaou}, title = {Lydia Workshop}, year = {} }

Share

OpenURL

Abstract

Given a graph G, a matching is a set of disjoint edges of G. A maximum matching is said to be perfect if it covers all vertices of G. Finding a maximum matching efficiently is a fundamental problem in graph theory with important applications in many branches of computer science. However, while many sequential deterministic algorithms have been proved for this problem, up to now no deterministic efficient parallel solution is known even for restricted classes of graphs, as for example, planar or bipartite graphs. Fortunately, important progress has been done from a parallel random point of view. Here, we first show how matchings can be used in order to solve the well-known 2-scheduling problem. Then we present the most important known efficient sequential and parallel algorithms for finding maximum matchings in graphs. 1 Introduction and notation With the rising use of highly parallel computers, scheduling problems have received considerable attention recent years. Much of scheduling w...