Thomas Luedi

Learn More
In this work we study local checkability of network properties like <i>s-t</i> reachability, or whether the network is acyclic or contains a cycle. A structural property <i>S</i> of a graph <i>G</i> is <i>locally checkable</i>, if there is a prover-and-verifier pair (<i>P, V</i>) as follows. The <i>prover P</i> assigns a label to each node in graphs(More)
  • 1