Parallel Algorithm for Cograph Recognition with Applications
From MaRDI portal
Publication:3141534
DOI10.1006/jagm.1993.1042zbMath0785.68040MaRDI QIDQ3141534
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
parallel algorithm; maximum matching; cographs; permutation graphs; permutation representation; CRCW PRAM; cotrees; depth-first spanning tree
68R10: Graph theory (including graph drawing) in computer science
68W10: Parallel algorithms in computer science
Related Items
Efficient parallel modular decomposition (extended abstract), On parallel recognition of cographs, A theorem on permutation graphs with applications, An NC algorithm for the clique cover problem in cocomparability graphs and its application, A fast parallel algorithm to recognize P4-sparse graphs, A time-optimal solution for the path cover problem on cographs., A faster parallel connectivity algorithm on cographs, Efficient parallel recognition of cographs