—We develop a new graph-theoretic approach for pairwise data clustering which is motivated by the analogies between the intuitive concept of a cluster and that of a dominant set ...
We propose a fast population game dynamics, motivated by the analogy with infection and immunization processes within a population of “players,” for finding dominant sets, a p...
Abstract—The paper studies graded properties of MTL valued binary connectives, focusing on conjunctive connectives such as t-norms, uninorms, aggregation operators, or quasicopul...
Libor Behounek, Petr Cintula, Ulrich Bodenhofer, S...
Dealing with interference is one of the primary challenges to solve in the design of protocols for wireless ad-hoc networks. Most of the work in the literature assumes localized o...
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...