The cycle roommates problem: a hard case of kidney exchange (Q2379931): 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.1016/j.ipl.2007.02.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2060780064 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5482465 / 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: The Structure of the Stable Roommate Problem: Efficient Representation and Enumeration of All Stable Assignments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995616 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for the “stable roommates” problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4130997 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pairwise kidney exchange / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:23, 2 July 2024

scientific article
Language Label Description Also known as
English
The cycle roommates problem: a hard case of kidney exchange
scientific article

    Statements

    The cycle roommates problem: a hard case of kidney exchange (English)
    0 references
    0 references
    24 March 2010
    0 references
    algorithms
    0 references
    combinatorial problems
    0 references
    computational complexity
    0 references
    matching
    0 references
    stability
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references