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

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: This research investigates the impact of the road network topological structure on facility location modeling. We create four types of road networks, i.e., the radial, the grid, the ring, ...

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