On the complexity of the minimum and maximum global snapshot problems

Abstract

Deriving the minimum and maximum global snapshots Is very useful for some error detection problems in distributed programs. Several researchers, e.g., Groselj, Chen and Wu, have shown that the minimum and maximum global snapshot problems are linear-time reducible to the maximum constant-ratio net work flow (MCNF) problem, here defined as the well-known maximum network flow problem with m = Theta(n), where m is the number of edges and n is the number of vertices in the given flow network. In this paper we show in a reverse way that the MCNF problem is also linear-time reducible to these global snapshot problems. Thus, we can conclude that the global snapshot problems are ''as difficult as'' the MCNF problem in terms of time complexity.