Distributed verification and hardness of distributed approximation

• Main Authors: Sarma, Atish Das., Holzer, Stephan., Kor, Liah., Korman, Amos., Nanongkai, Danupon., Pandurangan, Gopal., Peleg, David., Wattenhofer, Roger.
• Other Authors: School of Physical and Mathematical Sciences
• Format: Article
• Language: English
• Published: 2013
• Online Access: https://hdl.handle.net/10356/98003; http://hdl.handle.net/10220/10914
• Institution: Nanyang Technological University

We study the verification problem in distributed networks, stated as follows. Let $H$ be a subgraph of a network $G$ where each vertex of $G$ knows which edges incident on it are in $H$. We would like to verify whether $H$ has some properties, e.g., if it is a tree or if it is connected (every node...