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 4 items.
- Linear-time algorithm for the paired-domination problem in convex bipartite graphs (Q692884) (← 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)
