Now showing items 1-1 of 1

    • Problems on succinctly encoded graphs 

      Scharpfenecker, Patrick (Universität Ulm, 2017-06-20)
      Succinct encodings are short descriptions of relations such that the relation itself may be of size exponential in the size of its description. We can encode graphs, which are binary relations over a set of vertices, by ...