Best-Order Streaming Model

We study a new model of computation called stream checking on graph problems where a space-limited verifier has to verify a proof sequentially (i.e., it reads the proof as a stream). Moreover, the proof itself is nothing but a reordering of the input data. This model has a close relationship to many models of computation in other areas such as data streams, communication complexity, and proof checking and could be used in applications such as cloud computing. In this paper we focus on graph problems where the input is a sequence of edges. We show that checking if a graph has a perfect matching is impossible to do deterministically using small space. To contrast this, we show that randomized verifiers are powerful enough to check whether a graph has a perfect matching or is connected.

• Type: Conference
• Year: 2009
• Where: TAMC
• Authors: Atish Das Sarma, Richard J. Lipton, Danupon Nanongkai
• Keywords: Applied Computing, Checking, Computation Called Stream, Graph Problems, TAMC 2009