Parallel Algorithm for Cograph Recognition with Applications

DOI10.1006/jagm.1993.1042zbMath0785.68040OpenAlexW2066354186MaRDI QIDQ3141534

Xin He

Publication date: 6 December 1993

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/762222b3818f0770adc4e72960e910307d063f76

zbMATH Keywords

parallel algorithmmaximum matchingcographspermutation graphspermutation representationCRCW PRAMcotreesdepth-first spanning tree

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Related Items (8)

A theorem on permutation graphs with applications ⋮ A faster parallel connectivity algorithm on cographs ⋮ An NC algorithm for the clique cover problem in cocomparability graphs and its application ⋮ A fast parallel algorithm to recognize P4-sparse graphs ⋮ Efficient parallel modular decomposition (extended abstract) ⋮ A time-optimal solution for the path cover problem on cographs. ⋮ On parallel recognition of cographs ⋮ Efficient parallel recognition of cographs

This page was built for publication: Parallel Algorithm for Cograph Recognition with Applications