scientific article; zbMATH DE number 140476
zbMATH Open0765.68038MaRDI QIDQ4028894FDOQ4028894
Authors: Lin Chen 
Publication date: 28 March 1993
Title of this publication is not available (Why is that?)
Recommendations
maximum cliqueadjacency matrixNP-completeparallel algorithmsmaximum independent setcircular-arc graphminimum dominating setminimum clique coverNC algorithmssequential algorithmspolylogarithmic timecircular-arc representationgraph recognition problempolynomially bounded processors
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15) Graph theory (05C99)
Cited In (12)
- Polynomial time algorithms on circular-arc overlap graphs
- Revisiting Tucker's algorithm to color circular-arc graphs
- Circular-arc graphs with clique cover number two
- Parallel algorithms on circular-arc graphs
- Parallel algorithms on circular-arc graphs
- Optimal parallel algorithms on circular-arc graphs
- Independent Sets in Circular-Arc Graphs
- Efficient parallel recognition of some circular arc graphs. II
- Linear time algorithms on circular-arc graphs
- A constant factor approximation algorithm for boxicity of circular arc graphs
- Efficient parallel recognition of some circular arc graphs. I
- $O(M\cdot N)$ Algorithms for the Recognition and Isomorphism Problems on Circular-Arc Graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4028894)
