A routing algorithm is the most fundamental problem in complex network communication. In
complex networks, the amount of computation increases as the number of nodes increases …

The article considers an approach to implementing the architecture of a microservice system
for processing large volumes of data based on the event-oriented approach to managing the …

The maximum clique problem in graph theory is a well-known challenge that involves
identifying the complete subgraph with the highest number of nodes in a given graph, which …

Wireless Mesh Networks are gaining traction as a solution for delivering reliable connectivity
without centralized infrastructure. They operate through wireless node interconnections …

Wireless Mesh Networks (WMNs) are crucial for various sectors due to their adaptability and
scalability, providing robust connectivity where traditional wired networks are impractical …

In this work, the authors propose a routing algorithm based on information entropy theory for
calculating the metric, considering the probability of packet loss. Information entropy theory …

Identifying cohesive subgraphs is an important topic in graph theory and complex network
analysis. The quasi‐clique, as a generalization of clique, can be used to identify the …

In this paper, a cluster router based on eccentricity was worked out, related to the field of
telecommunications, especially, to the field of message transmission. Messages in this …