A conjecture by D. Seese states that if a set of graphs has a decidable monadic second-order theory, then it is the image of a set of trees under a transformation defined by monad...
- Clustering of data is an important data mining application. One of the problems with traditional partitioning clustering methods is that they partition the data into hard bound n...
Integrated Development Environments supporting software and model evolution have to deal with the problem of maintaining coherence between code and model despite changes which may...
Paolo Bottoni, Francesco Parisi-Presicce, Simone P...
A fibration of graphs is a morphism that is a local isomorphism of in-neighbourhoods, much in the same way a covering projection is a local isomorphism of neighbourhoods. This pap...
There would seem to be a natural connection between graphs and information security. This is particularly so in the arena of access control and authorization. Research on applying ...