Minimum Certificate Dispersal with Tree Structures

Taisuke Izumi, Tomoko Izumi, Hirotaka Ono +1

Given an n-vertex graph G=(V,E) and a set R \subseteq {{x,y} | x,y \in V} of requests, we consider to assign a set of edges to each vertex in G so that for every request {u, v} in…