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 Laplacian ...

The problem of finding the longest common subsequence (MLCS) for multiple sequences is a computationally intensive and challenging problem that has significant applications in various fields such as ...

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 ...