Shortest path algorithms sit at the heart of modern graph theory and many of the systems that move people, data, and goods around the world. After nearly seventy years of relying on the same classic ...

Graphs are everywhere. From technology to finance, they often model valuable information such as people, networks, biological pathways and more. Often, scientists and technologists need to come up ...

All of modern mathematics is built on the foundation of set theory, the study of how to organize abstract collections of objects. But in general, research mathematicians don’t need to think about it ...

ABSTRACT: A new nano-based architectural design of multiple-stream convolutional homeomorphic error-control coding will be conducted, and a corresponding hierarchical implementation of important class ...

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

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: Several interesting problems in multirobot systems can be cast in the framework of distributed optimization. Examples include multirobot task allocation, vehicle routing, target protection, ...

ABSTRACT: The excessive computational burden encountered in power market analysis has necessitated the need for obtaining reduced equivalent networks that preserve flows along certain selected lines ...

If you’re like me, you’ve heard plenty of talk about entity SEO and knowledge graphs over the past year. But when it comes to implementation, it’s not always clear which components are worth the ...