The sum of a coloring is the sum of the colors assigned to the vertices (assuming that the colors are positive integers). The sum (G) of graph G is the smallest sum that can be ach...
Abstract. We study the complexity of the isomorphism and automorphism problems for finite rings. We show that both integer factorization and graph isomorphism reduce to the problem...
The misalignment of information systems (IS) components with the rest of an organization remains a critical and chronic unsolved problem in today's complex and turbulent worl...
— Presented in this paper is a joint algorithm optimization and architecture design framework for analysis of repetitive regularities. Two closely coupled algorithm optimization ...
Distributed mechanisms that regulate the behavior of autonomous agents in open multi-agent systems (MAS) are of high interest since we cannot employ centralized approaches relying...