Research map / Graph learning / Graph algorithms and clustering
Small Representations of Big Kidney Exchange Graphs
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Increase the global compatibility threshold from t=0 to small positive values | Threshold compatibility for kidney-exchange matching · Generated UNOS graphs of varying sizes | matched patient-donor pairs: 3--4x | Helped |
| Raise the global compatibility threshold to t=5 | Threshold compatibility for kidney-exchange matching · Generated UNOS graphs of varying sizes | matched patient-donor pairs: all pairs | Helped |
| Represent real compatibility graphs with fewer attributes than the worst-case bound | Threshold representation of UNOS kidney-exchange graphs · Real UNOS compatibility graphs | number of attributes required for lossless representation | Helped |
Closest papers by meaning
- Improving Policy-Constrained Kidney Exchange via Pre-Screening (NeurIPS 2020 · similarity 0.91)
- Adapting a Kidney Exchange Algorithm to Align With Human Values (AAAI 2018 · similarity 0.90)
- Fast Optimal Clearing of Capped-Chain Barter Exchanges (AAAI 2016 · similarity 0.90)
- Learning to Build Solutions in Stochastic Matching Problems Using Flows (Student Abstract) (AAAI 2024 · similarity 0.82)
- Bipartite Matching in Massive Graphs: A Tight Analysis of EDCS (ICML 2024 · similarity 0.80)
- Stable Matchings in Practice: A Constraint Programming Approach (AAAI 2024 · similarity 0.80)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.