On the stable \(b\)-matching problem in multigraphs (Q2476254): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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.dam.2007.08.023 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2031198302 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The stable crews problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a generalization of the stable roommates problem / 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: 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: The Complexity of Counting Stable Marriages / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Stable Roommates Problem with Ties / rank
 
Normal rank
Property / cites work
 
Property / cites work: The stable fixtures problem -- a many-to-many extension of stable roommates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for the Stable Marriage Problem and Its Variants / rank
 
Normal rank

Latest revision as of 19:44, 27 June 2024

scientific article
Language Label Description Also known as
English
On the stable \(b\)-matching problem in multigraphs
scientific article

    Statements