Pages that link to "Item:Q3141534"
From MaRDI portal
The following pages link to Parallel Algorithm for Cograph Recognition with Applications (Q3141534):
Displaying 17 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)
- An optimal parallel algorithm for node ranking of cographs (Q1270781) (← links)
- A theorem on permutation graphs with applications (Q1328502) (← links)
- An optimal parallel matching algorithm for cographs (Q1338271) (← links)
- Efficient parallel recognition algorithms of cographs and distance hereditary graphs (Q1345961) (← links)
- An NC algorithm for the clique cover problem in cocomparability graphs and its application (Q1351615) (← 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)
- A simple linear time algorithm for cograph recognition (Q1764804) (← links)
- A faster parallel connectivity algorithm on cographs (Q2371145) (← links)
- Competitive graph searches (Q2481952) (← links)
- Efficient parallel recognition of cographs (Q2565857) (← links)
- (Q3676177) (← 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)