Pages that link to "Item:Q2897986"
From MaRDI portal
The following pages link to Computing Maximum Non-crossing Matching in Convex Bipartite Graphs (Q2897986):
Displaying 4 items.
- Finding maximum edge bicliques in convex bipartite graphs (Q1759663) (← links)
- A linear time algorithm for maximum matchings in convex, bipartite graphs (Q1921260) (← 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)