We investigate the existence of edge-magic labellings of countably infinite graphs by abelian groups. We show for that for a large class of abelian groups, including the integers ...
Nicholas J. Cavenagh, Diana Combe, Adrian M. Nelso...
Mining subgraphs is an area of research where we have a given set of graphs, and we search for (connected) subgraphs contained in these graphs. In this paper we focus on the analy...
Edgar H. de Graaf, Walter A. Kosters, Joost N. Kok...
Jeager et al introduced a concept of group connectivity as an generalization of nowhere zero flows and its dual concept group coloring, and conjectured that every 5-edge connected...
Self-Organizing Maps capable of encoding structured information will be used for the clustering of XML documents. Documents formatted in XML are appropriately represented as graph ...
Markus Hagenbuchner, Alessandro Sperduti, Ah Chung...
A simple extension of the critical path method is presented which allows more accurate optimization of circuits with level-sensitive latches. The extended formulation provides a s...