Abstract
This paper proposes a method for computing the expectation for the length of a maximum set of vertex-disjoint cycles in a digraph where vertices and/or arcs are subject to failure with a known probability. This method has an immediate practical application: it can be used for the solution of a kidney exchange program in the common situation where the underlying graph is unreliable. Results for realistic benchmark instances are reported and analyzed. © 2014 Springer International Publishing.
Author supplied keywords
Cite
CITATION STYLE
Pedroso, J. P. (2014). Maximizing expectation on vertex-disjoint cycle packing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8580 LNCS, pp. 32–46). Springer Verlag. https://doi.org/10.1007/978-3-319-09129-7_3
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
