Abstract—In this paper we ask which properties of a distributed network can be computed from a few amount of local information provided by its nodes. The distributed model we con...
In 2004, Klavins et al. introduced the use of graph grammars to describe--and to program--systems of self-assembly. It turns out that these graph grammars can be embedded in a gra...
We investigate the computational complexity of testing dominance and consistency in CP-nets. Up until now, the complexity of dominance has been determined only for restricted clas...
The notion of a map is a fundamental metaphor in spatial disciplines. However, there currently exist no adequate data models for maps that define a precise spatial data type for m...
In this work we propose a representation of the web as a directed hypergraph, instead of a graph, where links can connect not only pairs of pages, but also pairs of disjoint sets o...
Klessius Berlt, Edleno Silva de Moura, André...