Pages that link to "Item:Q919826"
From MaRDI portal
The following pages link to Parallel recognition of complement reducible graphs and cotree construction (Q919826):
Displaying 9 items.
- On parallel recognition of cographs (Q627166) (← links)
- A fast parallel algorithm to recognize partitionable graphs (Q917295) (← links)
- A theorem on permutation graphs with applications (Q1328502) (← links)
- Minimax trees in linear time with applications (Q1761500) (← links)
- A faster parallel connectivity algorithm on cographs (Q2371145) (← links)
- Efficient parallel recognition of cographs (Q2565857) (← links)
- Parallel Algorithm for Cograph Recognition with Applications (Q3141534) (← links)
- Parallel algorithm for cograph recognition with applications (Q5056132) (← links)
- Compact Distributed Interactive Proofs for the Recognition of Cographs and Distance-Hereditary Graphs (Q6488452) (← links)