Pages that link to "Item:Q3578311"
From MaRDI portal
The following pages link to Finding Maximum Edge Bicliques in Convex Bipartite Graphs (Q3578311):
Displaying 14 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)
- A continuous characterization of the maximum-edge biclique problem (Q742133) (← links)
- Maximum weighted edge biclique problem on bipartite graphs (Q779184) (← links)
- The induced matching and chain subgraph cover problems for convex bipartite graphs (Q995582) (← links)
- Algorithms for maximum independent set in convex bipartite graphs (Q1017904) (← links)
- Circular convex bipartite graphs: Maximum matching and Hamiltonian circuits (Q1350298) (← links)
- Biconvex graphs: Ordering and algorithms (Q1570816) (← links)
- Finding maximum edge bicliques in convex bipartite graphs (Q1759663) (← links)
- On list \(k\)-coloring convex bipartite graphs (Q2056881) (← links)
- Computing maximum non-crossing matching in convex bipartite graphs (Q2348053) (← links)
- A convexity upper bound for the number of maximal bicliques of a bipartite graph (Q2448895) (← links)
- An Integer Programming Formulation for the Maximum k-Subset Intersection Problem (Q3195319) (← links)
- The multicolored graph realization problem (Q6558680) (← links)