Round Compression for Parallel Matching Algorithms
Round Compression for Parallel Matching Algorithms
Related DatabasesWeb of Science You must be logged in with an active subscription to view this.Article DataHistorySubmitted: 2 July 2018Accepted: 11 February 2019Published online: 05 November 2019Keywordsmaximum matching, vertex partitioning, round compressionAMS Subject Headings05C70, 68W10, 68W15Publication DataISSN (print): 0097-5397ISSN (online): 1095-7111Publisher: Society for Industrial and Applied MathematicsCODEN: smjcat