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.
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 ...
Introduction: Voxel hierarchy on dynamic brain graphs is produced by k-core percolation on functional dynamic amplitude correlation of resting-state fMRI. Methods: Directed graphs and their ...
Department of Mathematics, Michigan State University, East Lansing, Michigan 48824, United States Department of Mathematics, Michigan State University, East Lansing, Michigan 48824, United States ...
Directed graphs are crucial in modeling complex real-world systems, from gene regulatory networks and flow networks to stochastic processes and graph metanetworks. Representing these directed graphs ...
1 Centre for Systems Modelling and Quantitative Biomedicine, University of Birmingham, Edgbaston, United Kingdom 2 School of Mathematics, University of Birmingham, Edgbaston, United Kingdom Trophic ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback