Pages that link to "Item:Q1759663"
From MaRDI portal
The following pages link to Finding maximum edge bicliques in convex bipartite graphs (Q1759663):
Displaying 12 items.
- A continuous characterization of the maximum-edge biclique problem (Q742133) (← links)
- Maximum weighted edge biclique problem on bipartite graphs (Q779184) (← links)
- Polynomial-time algorithms for subgraph isomorphism in small graph classes of perfect graphs (Q896655) (← links)
- Biconvex graphs: Ordering and algorithms (Q1570816) (← links)
- A biclique approach to reference anchored gene blocks and its applications to pathogenicity islands (Q1708410) (← links)
- Scalable parallel algorithms for maximum matching and Hamiltonian circuit in convex bipartite graphs (Q2283031) (← links)
- A convexity upper bound for the number of maximal bicliques of a bipartite graph (Q2448895) (← links)
- Scale reduction techniques for computing maximum induced bicliques (Q2633172) (← links)
- Finding Maximum Edge Bicliques in Convex Bipartite Graphs (Q3578311) (← links)
- Maximum Edge Bicliques in Tree Convex Bipartite Graphs (Q4632202) (← links)
- (Q4691855) (← links)
- The Bipartite QUBO (Q5050150) (← links)