Pages that link to "Item:Q1759663"
From MaRDI portal
The following pages link to Finding maximum edge bicliques in convex bipartite graphs (Q1759663):
Displaying 6 items.
- Polynomial-time algorithms for subgraph isomorphism in small graph classes of perfect graphs (Q896655) (← links)
- Scalable parallel algorithms for maximum matching and Hamiltonian circuit in convex bipartite graphs (Q2283031) (← links)
- Scale reduction techniques for computing maximum induced bicliques (Q2633172) (← links)
- Maximum Edge Bicliques in Tree Convex Bipartite Graphs (Q4632202) (← links)
- (Q4691855) (← links)
- The Bipartite QUBO (Q5050150) (← links)
