In order to deal efficiently with infinite regular trees (or other pointed graph structures), we give new algorithms to store such structures. The trees are stored in such a way th...
We propose a new Genetic Algorithm (GA) for solving the minimum span frequency assignment problem (MSFAP). The MSFAP is minimizing the range of the frequencies assigned to each tr...
Currently compilers contain a large number of optimisations which are based on a set of heuristics that are not guaranteed to be effective to improve the performance metrics. In th...
Abstract. We relate signs of edge-colorings (as in classical Penrose's result) with "Pfaffian labelings", a generalization of Pfaffian orientations, whereby edges ar...
Abstract. In this paper we study dualities of graphs and, more generally, relational structures with respect to full homomorphisms, that is, mappings that are both edge- and non-ed...