Synchronous regulated biological networks are often represented as logical diagrams, where the precise interactions between elements remain obscured. Here, we introduce a novel type of ...
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 ...
Abstract: For a multiagent system with a directed graph as its interaction topology, the consensus convergence rate is determined by the algebraic connectivity (the smallest real part of nonzero ...
There is a new sorting algorithm a deterministic O(m log2/3 n)-time algorithm for single-source shortest paths (SSSP) on directed graphs with real non-negative edge weights in the comparison-addition ...
If you want to solve a tricky problem, it often helps to get organized. You might, for example, break the problem into pieces and tackle the easiest pieces first. But this kind of sorting has a cost.
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: In this talk, I will present a new combinatorial algorithm for maximum flow that is based on running the weighted push-relabel algorithm introduced in [BBST ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback