Pages that link to "Item:Q1315996"
From MaRDI portal
The following pages link to Efficient labelling algorithms for the maximum noncrossing matching problem (Q1315996):
Displaying 6 items.
- Strongly stable and maximum weakly stable noncrossing matchings (Q1979449) (← links)
- Maximum weighted matching with few edge crossings for 2-layered bipartite graph (Q2004074) (← links)
- Computing maximum non-crossing matching in convex bipartite graphs (Q2348053) (← links)
- Constrained tree inclusion (Q2569419) (← links)
- Optimal partition of a bipartite graph into non-crossing matchings (Q3438979) (← links)
- Optimal Partition of a Bipartite Graph with Prescribed Layout into Non-Crossing b-Matchings (Q3439389) (← links)
