An optimal parallel matching algorithm for cographs

DOI10.1006/jpdc.1994.1067zbMath0819.68089OpenAlexW2043845884MaRDI QIDQ1338271

V. Pereyra

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

zbMATH Keywords

cographscomplement-reducible graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Related Items (3)

An \(O(n)\) time algorithm for maximum matching in \(P_{4}\)-tidy graphs ⋮ A faster parallel connectivity algorithm on cographs ⋮ A fast parallel algorithm to recognize P4-sparse graphs

This page was built for publication: An optimal parallel matching algorithm for cographs