scientific article
From MaRDI portal
Publication:4028894
zbMath0765.68038MaRDI QIDQ4028894
Publication date: 28 March 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
adjacency matrixparallel algorithmsNP-completemaximum independent setmaximum cliquecircular-arc graphminimum dominating setminimum clique coverNC algorithmssequential algorithmspolylogarithmic timecircular-arc representationgraph recognition problempolynomially bounded processors
Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (05C99) Distributed algorithms (68W15)
Related Items (2)
Efficient parallel recognition of some circular arc graphs. II ⋮ Efficient parallel recognition of some circular arc graphs. I
This page was built for publication: