Q4028894
type: Item
instance of: scholarly article
zbMATH Open document ID: 0765.68038
author: Lin Chen
publication date: 1993-03-28T00:00:00Z
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 05C99
zbMATH DE Number: 140476
zbMATH Keywords: NC algorithms
zbMATH Keywords: sequential algorithms
zbMATH Keywords: NP-complete
zbMATH Keywords: parallel algorithms
zbMATH Keywords: graph recognition problem
zbMATH Keywords: polylogarithmic time
zbMATH Keywords: polynomially bounded processors
zbMATH Keywords: circular-arc graph
zbMATH Keywords: adjacency matrix
zbMATH Keywords: circular-arc representation
zbMATH Keywords: maximum independent set
zbMATH Keywords: minimum dominating set
zbMATH Keywords: minimum clique cover
zbMATH Keywords: maximum clique
MaRDI profile type: MaRDI publication profile
Recommended article: Optimal parallel algorithms on circular-arc graphs
Recommended article: Q3361906
Recommended article: Efficient parallel recognition of some circular arc graphs. I
Recommended article: Linear time algorithms on circular-arc graphs
Recommended article: Efficient parallel recognition of some circular arc graphs. II
description: scientific article