Maximum Weight Cycle Packing in Directed Graphs, with Application to Kidney Exchange Programs

@article{Bir2009MaximumWC,
  title={Maximum Weight Cycle Packing in Directed Graphs, with Application to Kidney Exchange Programs},
  author={P{\'e}ter Bir{\'o} and David Manlove and Romeo Rizzi},
  journal={Discrete Math., Alg. and Appl.},
  year={2009},
  volume={1},
  pages={499-518}
}
Centralised matching programs have been established in several countries to organise kidney exchanges between incompatible patient-donor pairs. At the heart of these programs are algorithms to solve kidney exchange problems, which can be modelled as cycle packing problems in a directed graph, involving cycles of length 2, 3, or even longer. Usually the goal… CONTINUE READING

1 Figure or Table

Topics

Statistics

0510201020112012201320142015201620172018
Citations per Year

51 Citations

Semantic Scholar estimates that this publication has 51 citations based on the available data.

See our FAQ for additional information.