Popular Half-Integral Matchings.
From MaRDI portal
Publication:4598155
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Matching models (91B68)
Recommendations
- Popular matchings in complete graphs
- Popular Matchings in Complete Graphs
- Popular matchings with ties and matroid constraints
- Popular matchings and limits to tractability
- Optimal popular matchings
- Matchings and Hadwiger's conjecture
- Popular matchings: structure and algorithms
- Popular Matchings: Structure and Algorithms
- Popular matchings in the stable marriage problem
- Popular matchings in the stable marriage problem
Cited in
(15)- Popular Matchings in Complete Graphs
- Popular matchings with two-sided preferences and one-sided ties
- Understanding popular matchings via stable matchings
- Popularity, mixed matchings, and self-duality
- Popular branchings and their dual certificates
- Popular Matchings -- structure and cheating strategies
- Popular matchings with multiple partners
- Popular matchings with lower quotas
- Popularity, Mixed Matchings, and Self-Duality
- Quasi-popular matchings, optimality, and extended formulations
- Popular matchings in complete graphs
- Popular branchings and their dual certificates
- Maximum matchings and popularity
- Popular matchings with weighted voters
- Two problems in max-size popular matchings
This page was built for publication: Popular Half-Integral Matchings.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4598155)
