The following pages link to (Q5306146):
Displaying 14 items.
- Generalized coarse matching (Q516979) (← links)
- Ordinal and cardinal solution concepts for two-sided matching (Q523004) (← links)
- Algorithms for some graph theoretical optimization problems (abstract of thesis) (Q862821) (← links)
- The manipulability of matching rules via segmentation (Q868616) (← links)
- The parity problem of polymatroids without double circuits (Q987548) (← links)
- Optimal general matchings (Q1627167) (← links)
- Designing matching mechanisms under constraints: an approach from discrete convex analysis (Q1757595) (← links)
- Building and combining matching algorithms (Q2185488) (← links)
- A fast algorithm for the path 2-packing problem (Q2268342) (← links)
- A weighted independent even factor algorithm (Q2429469) (← links)
- Packing \(A\)-paths in group-labelled graphs via linear matroid parity (Q2797090) (← links)
- A Weighted K t,t -Free t-Factor Algorithm for Bipartite Graphs (Q3503840) (← links)
- Optimal Matching and Empirical Measures (Q4206152) (← links)
- More Efficient Match-Making and Satisfiability The Five Card Trick (Q5110898) (← links)