Popular Half-Integral Matchings.
From MaRDI portal
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Graph theory (including graph drawing) in computer science (68R10) 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
(22)- Popular branchings and their dual certificates
- Two problems in max-size popular matchings
- Popular matchings in complete graphs
- Popular Matchings -- structure and cheating strategies
- Popularity, mixed matchings, and self-duality
- Popularity, Mixed Matchings, and Self-Duality
- Understanding popular matchings via stable matchings
- Popular branchings and their dual certificates
- Quasi-popular matchings, optimality, and extended formulations
- Popular Matchings in Complete Graphs
- Popular matchings with multiple partners
- Popular matchings with lower quotas
- Popular matchings with two-sided preferences and one-sided ties
- Maximum matchings and popularity
- Popular matchings with weighted voters
- Min-cost popular matchings
- Popular matchings with one-sided bias
- Matchings, relaxed popularity, and optimality
- Testing popularity in linear time via maximum matching
- Popular matchings with one-sided bias
- Popular roommates in simply exponential time
- Maximum matchings and popularity
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)
