For a 3-colourable graph G, the 3-colour graph of G, denoted C3(G), is the graph with node set the proper vertex 3-colourings of G, and two nodes adjacent whenever the correspondi...
Luis Cereceda, Jan van den Heuvel, Matthew Johnson
Key distribution is one of the most challenging security issues in wireless sensor networks where sensor nodes are randomly scattered over a hostile territory. In such a sensor dep...
models require the identi cation of abstractions and approximations that are well suited to the task at hand. In this paper we analyze the problem of automatically selecting adequ...
Improvements at the physical network layer have enabled technologies such as 10 Gigabit Ethernet. Single core end-systems are unable to fully utilise these networks, due to limite...
In existing RBAC literature, administrative privileges are inherited just like ordinary user privileges. We argue that from a security viewpoint this is too restrictive, and we be...
M. A. C. Dekker, J. G. Cederquist, Jason Crampton,...