Abstract: Embodiments of the present invention provide systems, methods, and computer storage media for determining an increased matching for large graphs in which an increased matching is generated for the graph by leveraging an initial matching for a small fraction of edges of the large graph. An initial matching for a random subset of edges of an input graph is leveraged to generate alternating paths based on the initially matched edges and the remaining edges, not included in the random subset. An increased matching for the entire graph includes the alternating paths without the initial matched edges, thus increasing the number of matched edges in the increased matching by at least one for every initially matched edge. Graph-based tasks may then be triggered based on the increased matching.

Abstract: Embodiments of the present invention provide systems, methods, and computer storage media for determining an increased matching for large graphs in which an increased matching is generated for the graph by leveraging an initial matching for a small fraction of edges of the large graph. An initial matching for a random subset of edges of an input graph is leveraged to generate alternating paths based on the initially matched edges and the remaining edges, not included in the random subset. An increased matching for the entire graph includes the alternating paths without the initial matched edges, thus increasing the number of matched edges in the increased matching by at least one for every initially matched edge. Graph-based tasks may then be triggered based on the increased matching.