The reinforcement number of a graph is the smallest number of edges that have to be added to a graph to reduce the domination number. We introduce the k-reinforcement number of a ...
Jean R. S. Blair, Wayne Goddard, Stephen T. Hedetn...
In this paper we define nQML, a functional quantum programming language that follows the "quantum data and control" paradigm. In comparison to Altenkirch and Grattage...
Michael Lampis, Kyriakos G. Ginis, Michalis A. Pap...
Arc Routing Problems on mixed graphs have been modelled in the literature either using just one variable per edge or associating to each edge two variables, each one representing ...
We study what kinds of limits are preserved by the greatest semilattice image functor from the category of all semigroups to its subcategory of all semilattices. The second autho...
We present GMC2 , a software model checker for GCC, the opensource compiler from the Free Software Foundation (FSF). GMC2 , which is part of the GMC static-analysis and model-check...
Radu Grosu, Xiaowan Huang, Sumit Jain, Scott A. Sm...