Pages that link to "Item:Q3578311"
From MaRDI portal
The following pages link to Finding Maximum Edge Bicliques in Convex Bipartite Graphs (Q3578311):
Displaying 4 items.
- Solving the maximum edge biclique packing problem on unbalanced bipartite graphs (Q496657) (← links)
- Linear-time algorithm for the paired-domination problem in convex bipartite graphs (Q692884) (← links)
- On list \(k\)-coloring convex bipartite graphs (Q2056881) (← links)
- An Integer Programming Formulation for the Maximum k-Subset Intersection Problem (Q3195319) (← links)
