185

Corruption Detection on Networks

Theory of Computing (ToC), 2015
Abstract

We consider the problem of corruption detection on networks. We show that graph expansion is necessary for corruption detection and discuss algorithms and the computational hardness of the problem.

View on arXiv
Comments on this paper