Pages that link to "Item:Q1017904"
From MaRDI portal
The following pages link to Algorithms for maximum independent set in convex bipartite graphs (Q1017904):
Displaying 10 items.
- Linear-time algorithm for the paired-domination problem in convex bipartite graphs (Q692884) (← links)
- An optimal maximal independent set algorithm for bounded-independence graphs (Q992507) (← links)
- Parallel maximum independent set in convex bipartite graphs (Q1350905) (← links)
- Finding maximum edge bicliques in convex bipartite graphs (Q1759663) (← links)
- Linear-time algorithms for maximum-weight induced matchings and minimum chain covers in convex bipartite graphs (Q2118390) (← links)
- Scalable parallel algorithms for maximum matching and Hamiltonian circuit in convex bipartite graphs (Q2283031) (← links)
- Advice complexity of maximum independent set in sparse and bipartite graphs (Q2344218) (← links)
- Coarse grained parallel algorithms for detecting convex bipartite graphs (Q2766672) (← links)
- Finding Maximum Edge Bicliques in Convex Bipartite Graphs (Q3578311) (← links)
- Efficient Sequential and Parallel Algorithms for Maximal Bipartite Sets (Q4033763) (← links)