Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Kunysz, Adam"'
Publikováno v:
In Theoretical Computer Science 13 September 2023 972
Given a bipartite graph, where the two sets of vertices are applicants and posts and ranks on the edges represent preferences of applicants over posts, a {\em rank-maximal} matching is one in which the maximum number of applicants is matched to their
Externí odkaz:
http://arxiv.org/abs/1703.10594
An instance of a strongly stable matching problem (SSMP) is an undirected bipartite graph $G=(A \cup B, E)$, with an adjacency list of each vertex being a linearly ordered list of ties, which are subsets of vertices equally good for a given vertex. T
Externí odkaz:
http://arxiv.org/abs/1506.00677
Autor:
Kunysz, Adam
An instance of the maximum weight strongly stable matching problem with incomplete lists and ties is an undirected bipartite graph G = (A cup B, E), with an adjacency list being a linearly ordered list of ties, which are vertices equally good for a g
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::067034744bcc14b5ddb552785a2ad28b
Autor:
Kunysz, Adam
An instance of the strongly stable roommates problem with incomplete lists and ties (SRTI) is an undirected non-bipartite graph G = (V,E), with an adjacency list being a linearly ordered list of ties, which are vertices equally good for a given verte
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::80e92257d5327e36817988d1cdab9786
Autor:
Pinar Heggernes
This book constitutes the refereed conference proceedings of the 11th International Conference on Algorithms and Complexity, CIAC 2019, held in Rome, Italy, in May 2019. The 30 full papers were carefully reviewed and selected from 95 submissions. The
This book constitutes the proceedings of the 13th Latin American Symposium on Theoretical Informatics, LATIN 2018, held in Buenos Aires, Argentina, in April 2018. The 63 papers presented in this volume were carefully reviewed and selected from 161 s