Pages that link to "Item:Q2766672"
From MaRDI portal
The following pages link to Coarse grained parallel algorithms for detecting convex bipartite graphs (Q2766672):
Displaying 6 items.
- Efficient parallel algorithms for doubly convex-bipartite graphs (Q672468) (← links)
- Algorithms for maximum independent set in convex bipartite graphs (Q1017904) (← links)
- Parallel maximum independent set in convex bipartite graphs (Q1350905) (← links)
- Efficient parallel graph algorithms for coarse-grained multicomputers and BSP (Q1601013) (← links)
- Scalable parallel algorithms for maximum matching and Hamiltonian circuit in convex bipartite graphs (Q2283031) (← links)
- Coarse-Grained Parallel Transitive Closure Algorithm: Path Decomposition Technique (Q4432861) (← links)