scientific article; zbMATH DE number 140480
From MaRDI portal
Publication:4028898
cographscographs recognitiondominating setisomorphismminimal chainminimum fill-inNC algorithmparallel algorithmsparity graphperfect graphtransitive orientationweighted clique
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)
Recommendations
- Parallel algorithms for cographs and parity graphs with applications
- Parallel Algorithm for Cograph Recognition with Applications
- Parallel recognition of complement reducible graphs and cotree construction
- Parallel algorithm for cograph recognition with applications
- Efficient parallel recognition of cographs
Cited in
(7)- An NC algorithm for the clique cover problem in cocomparability graphs and its application
- Efficient parallel recognition of cographs
- scientific article; zbMATH DE number 4213472 (Why is no real title available?)
- Parallel algorithms for cographs and parity graphs with applications
- scientific article; zbMATH DE number 3896983 (Why is no real title available?)
- A Linear Recognition Algorithm for Cographs
- On parallel recognition of cographs
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 Q4028898)
