A Calculus of Communicating Systems
A Calculus of Communicating Systems
The computational complexity of the role assignment problem
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Summarizing Dynamic Bipolar Conflict Structures
IEEE Transactions on Visualization and Computer Graphics
A theoretical investigation of regular equivalences for fuzzy graphs
International Journal of Approximate Reasoning
Group-Level Analysis and Visualization of Social Networks
Algorithmics of Large and Complex Networks
Coloring random 3-colorable graphs with non-uniform edge probabilities
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Hi-index | 0.00 |
Standard methods for role assignment partition the vertex set of a graph in such a way that vertices in the same class can be considered to have equivalent roles in the graph Several classes of equivalence relations such as regular equivalence and equitable partitions have been proposed for role assignment, but they all suffer from the strictness of classifying vertices into being either equivalent or not It is an open problem how to allow for varying degrees of similarity Proposals include ad-hoc algorithmic approaches and optimization approaches which are computationally hard. In this paper we introduce the concept of structural similarity by relaxation of equitable partitions, thus providing a theoretical foundation for similarity measures which enjoys desirable properties with respect to existence, structure, and tractability.