Abstract: Give a finite undirected graph G = (V, E) and a positive integer κ ≥ 1, a distance-k matching is an edge set D ⊂ E that the pairwise distance of edges in D is at least k in G. The famous ...
Abstract: The maximum matching algorithm for bipartite graphs can be used to provide optimal scheduling for crossbar based interconnection networks. Unfortunately, maximum matching requires O(N 3) ...
Gale Shapley (GS) Algorithm also known as the Stable Matching (SM) problem is a constructive algorithm used to find a stable match meaning for given a candidate the algorithm would find its preferable ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results