Pages that link to "Item:Q1338271"
From MaRDI portal
The following pages link to An optimal parallel matching algorithm for cographs (Q1338271):
Displaying 8 items.
- An \(O(n)\) time algorithm for maximum matching in \(P_{4}\)-tidy graphs (Q287094) (← links)
- An efficient parallel algorithm for maximum matching for some classes of graphs (Q1268785) (← links)
- A fast parallel algorithm to recognize P4-sparse graphs (Q1382265) (← links)
- Parallel algorithms for flexible pattern matching on big graphs (Q2195447) (← links)
- A faster parallel connectivity algorithm on cographs (Q2371145) (← links)
- Efficient parallel recognition of cographs (Q2565857) (← links)
- Parallel graph algorithms for finding weighted matchings and subgraphs in computational science (Q2830821) (← links)
- A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs (Q4561265) (← links)