An optimal parallel matching algorithm for cographs
From MaRDI portal
Publication:1338271
DOI10.1006/jpdc.1994.1067zbMath0819.68089MaRDI QIDQ1338271
Publication date: 27 November 1994
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jpdc.1994.1067
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
68W15: Distributed algorithms
Related Items
An \(O(n)\) time algorithm for maximum matching in \(P_{4}\)-tidy graphs, A fast parallel algorithm to recognize P4-sparse graphs, A faster parallel connectivity algorithm on cographs