1.9k citations · 11.3k across the 35 of their papers we have counts for
1 paper · 2 filters
João Pedro Pedroso, Shiro Ikeda
This paper addresses the problem of maximizing the expected size of a matching in the case of unreliable vertices and/or edges. The assumption is that upon failure, remaining verti…