The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
The definitions of four previously studied parameters related to total coverings and total matchings of graphs can be restricted, thereby obtaining eight parameters related to cov...
In this paper we present a model for coalition formation and payo distribution in general environments. We focus on a reduced complexity kernel-oriented coalition formation model,...
The aim of edge modification problems is to change the edge set of a given graph as little as possible in order to satisfy a certain property. Edge modification problems in graphs...
An agent population can be evolved in a complex environment to perform various tasks and optimize its job performance using Learning Classifier System (LCS) technology. Due to the...