Understanding the generalized median stable matchings (Q1959721): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-009-9307-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2098850032 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Medians in median graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time algorithm for an optimal stable assignment with multiple partners / rank
 
Normal rank
Property / cites work
 
Property / cites work: A ternary operation in distributive lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every finite distributive lattice is a set of stable matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Generalized Median Stable Matchings: Finding Them Is Not That Easy / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to finding good stable matchings in the hospitals/residents setting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching in Trees, Series-Parallel and Interval Orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable networks and product graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fixed-Point Approach to Stable Matchings and Some Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: College Admissions and the Stability of Marriage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three Fast Algorithms for Four Problems in Stable Marriage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995616 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Counting Stable Marriages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Median stable matching for college admissions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Medians and Majorities in Semimodular Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4918387 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theorie De La Mediane Dans Les Treillis Distributes Finis Et Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single Machine Scheduling with Precedence Constraints of Dimension 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching in 2-dimensional partial orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Geometry of Fractional Stable Matchings and Its Applications / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:54, 3 July 2024

scientific article
Language Label Description Also known as
English
Understanding the generalized median stable matchings
scientific article

    Statements

    Understanding the generalized median stable matchings (English)
    0 references
    0 references
    0 references
    7 October 2010
    0 references
    stable matchings
    0 references
    fair stable matchings
    0 references
    medians in distributive lattices
    0 references
    counting closed subsets or antichains
    0 references

    Identifiers