Pages that link to "Item:Q2565857"
From MaRDI portal
The following pages link to Efficient parallel recognition of cographs (Q2565857):
Displaying 15 items.
- On parallel recognition of cographs (Q627166) (← links)
- A fast parallel algorithm to recognize partitionable graphs (Q917295) (← links)
- Parallel recognition of complement reducible graphs and cotree construction (Q919826) (← links)
- A theorem on permutation graphs with applications (Q1328502) (← links)
- Efficient parallel recognition algorithms of cographs and distance hereditary graphs (Q1345961) (← links)
- Constant-time parallel recognition of split graphs (Q1349719) (← links)
- A fast parallel algorithm to recognize P4-sparse graphs (Q1382265) (← links)
- A time-optimal solution for the path cover problem on cographs. (Q1401176) (← links)
- The Hamiltonian problem on distance-hereditary graphs (Q2489947) (← links)
- Linear-time algorithm for the matched-domination problem in cographs (Q3101607) (← links)
- Parallel Algorithm for Cograph Recognition with Applications (Q3141534) (← links)
- (Q3676177) (← links)
- A Linear Recognition Algorithm for Cographs (Q3694709) (← 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)