Abstract: In social networks, weighted graph anonymity is gaining more and more attention. But fan-following graphs like Twitter's are not protected by anonymity ...

1 Department of Industrial Engineering and Maintenance, Polytechnic University of Mongo, Mongo, Chad. 2 Department of Technical Sciences, University of N’Djamena, N’Djamena, Chad. 3 Department of ...

ABSTRACT: This paper contributes to the theoretical literature by analyzing the relationship between changes in sparsity and their impacts on financial networks with incomplete and random ...

Abstract: The problem of cooperative behavior of a set of agents in an environment given by a directed state graph is considered. The task is to achieve the required balance between the length of the ...

Graph theory is an integral component of algorithm design that underlies sparse matrices, relational databases, and networks. Improving the performance of graph algorithms has direct implications to ...

The goal of this project is to compare two well-known algorithms for finding the shortest path in a graph – Dijkstra's Algorithm and Bellman-Ford Algorithm. The implementation should allow for the ...

This project solves the problem of transporting heavy loads between cities by finding viable paths through viaducts with height restrictions, using a modified Dijkstra's algorithm for optimal routing.