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

Holland and Leinhardt (1981) proposed the p 1 model for the analysis of binary directed graph data in network studies. Such a model provides information about the "attractiveness" and "expansiveness" ...

In directed graphs, the relationship between users is asymmetric, resulting in two types of triangles: cycle triangles and flow triangles. This paper studies the problem of privacy-preserving triangle ...

In this paper, we consider an online constrained aggregative optimization problem over directed communication topology. Specially, for each agent, the local cost function is determined by a local set ...