skip to main content

Stable Matching I

Geng, Yu

figshare 2020

Texto completo disponível

Citações Citado por
  • Título:
    Stable Matching I
  • Autor: Geng, Yu
  • Assuntos: Applied Computer Science ; Theoretical Computer Science
  • Descrição: In mathematics, economics, and computer science, the stable marriage problem (also stable matching problem or SMP) is the problem of finding a stable matching between two equally sized sets of elements given an ordering of preferences for each element. A matching is a bijection from the elements of one set to the elements of the other set.
  • Editor: figshare
  • Data de criação/publicação: 2020
  • Idioma: Inglês

Buscando em bases de dados remotas. Favor aguardar.