Pages that link to "Item:Q2348053"
From MaRDI portal
The following pages link to Computing maximum non-crossing matching in convex bipartite graphs (Q2348053):
Displaying 8 items.
- Efficient labelling algorithms for the maximum noncrossing matching problem (Q1315996) (← links)
- Circular convex bipartite graphs: Maximum matching and Hamiltonian circuits (Q1350298) (← links)
- Finding maximum edge bicliques in convex bipartite graphs (Q1759663) (← links)
- A linear time algorithm for maximum matchings in convex, bipartite graphs (Q1921260) (← links)
- Strongly stable and maximum weakly stable noncrossing matchings (Q1979449) (← links)
- Maximum weighted matching with few edge crossings for 2-layered bipartite graph (Q2004074) (← links)
- Disjoint compatibility graph of non-crossing matchings of points in convex position (Q2263780) (← links)
- Faster bottleneck non-crossing matchings of points in convex position (Q2401333) (← links)