Let G=(V,E) be an undirected graph with costs on the edges specified by . A Steiner tree is any tree of G which spans all nodes in a given subset R of...
Some formal methods for cryptographic protocol analysis represent message fields using a free term algebra, which does not permit an explicit symmetri...
In this paper, we describe an important shortcoming of the first self-certified model proposed by Girault, that may be exploited by the authority to c...
A bisection of an n-vertex graph is a partition of its vertices into two sets S and T, each of size n/2. The bisection cost is the number of edges con...
