On parallel recognition of cographs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 107951 (Why is no real title available?)
- scientific article; zbMATH DE number 1142306 (Why is no real title available?)
- scientific article; zbMATH DE number 975369 (Why is no real title available?)
- A Linear Recognition Algorithm for Cographs
- A simple parallel tree contraction algorithm
- An optimal parallel algorithm for node ranking of cographs
- An optimal parallel co-connectivity algorithm
- Complement reducible graphs
- Dacey Graphs
- Efficient parallel recognition algorithms of cographs and distance hereditary graphs
- Efficient parallel recognition of cographs
- Parallel Algorithm for Cograph Recognition with Applications
- Parallel algorithms for cographs and parity graphs with applications
- Parallel recognition of complement reducible graphs and cotree construction
Cited in
(6)- scientific article; zbMATH DE number 3896983 (Why is no real title available?)
- The micro-world of cographs
- Efficient parallel recognition of cographs
- Parallel Algorithm for Cograph Recognition with Applications
- Efficient parallel recognition algorithms of cographs and distance hereditary graphs
- A fast parallel algorithm to recognize partitionable graphs
This page was built for publication: On parallel recognition of cographs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q627166)