Abstract: This note considers the distributed optimization problem on directed graphs with nonconvex local objective functions and the unknown network connectivity. A new adaptive algorithm is ...

The original version of this story appeared in Quanta Magazine. 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 ...

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.

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

Computer scientists at ETH Zurich have written a network flow algorithm that computes almost as fast as is mathematically possible. This algorithm computes the maximum traffic flow with minimum ...

Gal Gadot plays an international superspy who teams up with an all-powerful computer in this ludicrous and derivative Netflix espionage thriller. By Calum Marsh When you purchase a ticket for an ...

The directed acyclic graph (DAG) vs. blockchain debate brings new life to the cryptocurrency industry. Ever since Satoshi Nakamoto first published the Bitcoin (BTC) white paper, distributed ledger ...

Abstract: This paper investigates the resource allocation problem for a group of agents communicating over a strongly connected directed graph, where the total objective function of the problem is ...

Graph layout algorithms used in network visualization represent the first and the most widely used tool to unveil the inner structure and the behavior of complex networks. Current network ...

In algorithms, as in life, negativity can be a drag. Consider the problem of finding the shortest path between two points on a graph — a network of nodes connected by links, or edges. Often, these ...