A TypeScript implementation of the Hopcroft-Karp algorithm for finding maximum bipartite matchings, with special focus on perfect matchings in bipartite graphs. The Hopcroft-Karp algorithm finds a ...

A matching is a subset of edges in which no node occurs more than once. The weight of a matching is the sum of the weights of its edges. A maximal matching cannot add more edges and still be a ...

Abstract: We study local computation algorithms (LCA) for maximum matching. An LCA does not return its output entirely, but reveals parts of it upon query. For matchings, each query is a vertex v; the ...

We study the problem of estimating the size of a maximum matching in sublinear time. The problem has been studied extensively in the literature and various algorithms and lower bounds are known for it ...

Abstract: Summary form only given. An input-queued switch with virtual output queuing is able to provide a maximum throughput of 100% in the supporting more sophisticated scheduling strategies. Switch ...