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 ...
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 ...
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 ...
A set of vertices with each vertex having zero or more labels and zero or more properties/attributes. A set of edges with each edge being directed from one vertex to another vertex. Each edge has zero ...
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 ...
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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback