In algorithms, as in life, negativity can be a drag. Consider the problem of finding the shortest path between two points on a graph — a network of nodes connected by links, or edges. Often, these ...

Abstract: In this paper, we present an algorithm, called CluE (The Cluster Expander of Compound Graphs), that expands cluster nodes in compound graphs. CluE was designed to work with multiple layout ...

Abstract: In this paper, the issue of modeling the transformations of information links in the architecture of cybersecurity of systems with discretionary access control on graphs using the formal ...