Pages that link to "Item:Q2283031"
From MaRDI portal
The following pages link to Scalable parallel algorithms for maximum matching and Hamiltonian circuit in convex bipartite graphs (Q2283031):
Displaying 6 items.
- Efficient parallel algorithms for doubly convex-bipartite graphs (Q672468) (← links)
- Algorithms for maximum independent set in convex bipartite graphs (Q1017904) (← links)
- Circular convex bipartite graphs: Maximum matching and Hamiltonian circuits (Q1350298) (← links)
- Parallel maximum independent set in convex bipartite graphs (Q1350905) (← links)
- Computing maximum non-crossing matching in convex bipartite graphs (Q2348053) (← links)
- Coarse grained parallel algorithms for detecting convex bipartite graphs (Q2766672) (← links)