Pages that link to "Item:Q1382265"
From MaRDI portal
The following pages link to A fast parallel algorithm to recognize P4-sparse graphs (Q1382265):
Displaying 4 items.
- An optimal parallel solution for the path cover problem on \(P_{4}\)-sparse graphs (Q868040) (← links)
- Some new classes of open distance-pattern uniform graphs (Q2248722) (← links)
- Efficient parallel recognition of cographs (Q2565857) (← links)
- Parallel algorithms for P4-comparability graphs (Q4818673) (← links)