Parallel recognition of complement reducible graphs and cotree construction
type: Item
instance of: scholarly article
title: Parallel recognition of complement reducible graphs and cotree construction
zbMATH Open document ID: 0707.68039
DOI: 10.1016/0166-218X(90)90083-O
published in: Discrete Applied Mathematics
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68N20
zbMATH DE Number: 4162265
zbMATH Keywords: parallel algorithm
zbMATH Keywords: parse tree representation
zbMATH Keywords: cographs
zbMATH Keywords: CREW PRAM
author: David Kirkpatrick
author: Teresa Przytycka
MaRDI profile type: Publication
cites work: A simple parallel tree contraction algorithm
cites work: Q3798228
cites work: The Parallel Evaluation of General Arithmetic Expressions
cites work: Q3222874
cites work: The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time
cites work: Complement reducible graphs
cites work: A Linear Recognition Algorithm for Cographs
cites work: Q3761691
cites work: Parallel recognition and decomposition of two terminal series parallel graphs
cites work: Computing connected components on parallel computers
cites work: On a class of posets and the corresponding comparability graphs
cites work: Q4385522
cites work: Dacey Graphs
description: scientific article; zbMATH DE number 4162265