A team of EPFL researchers has developed an AI algorithm that can model complex dynamical processes while taking into account ...

The art of finding patterns or communities plays a central role in the analysis of structured data such as networks. Community detection in graphs has become a field on its own. Real-world networks, ...

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 paper, the average consensus problem has been considered for undirected networks under finite bit-rate communication. While other algorithms reach approximate average consensus or ...

Here’s a scary scenario: You’ve been put in charge of air traffic control at Newark airport near New York. You need to make sure every plane can taxi between the runway and its gate without hitting ...

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

Abstract: We study blind deconvolution of signals defined on the nodes of an undirected graph. Although observations are bilinear functions of both unknowns, namely the forward convolutional filter ...

If you’ve been making the same commute for a long time, you’ve probably settled on what seems like the best route. But “best” is a slippery concept. Perhaps one day there’s an accident or road closure ...

Swift Graphs library provides a composable and extensible foundation for working with graphs. Whether you're constructing binary trees, performing complex graph traversals, or optimizing pathfinding ...