New Scientist

Peter Shor’s algorithm could break the internet – but he's not worried

Few people have invented an algorithm with the potential to spark a worldwide crisis, so why is quantum computing pioneer ...
HackerNoon

The Race to Build AI’s Context Layer Is Really About Meaning

Context graphs, graph memory, and ontologies for AI are converging. What does this mean for enterprise AI in 2026?
GitHub

Edge Addition Planarity Suite

A secondary purpose of this repository is to provide a generalized graph API that enables implementation of a very wide range of in-memory graph algorithms including basic methods for reading, writing ...
IEEE

Multi-Agent Reinforcement Learning With Spatial Structure Awareness for Topological Map-Based Path-Finding

Abstract: Efficient Multi-Agent Path Finding (MAPF) is pivotal for warehouse logistics. While existing learning-based methods primarily rely on computationally intensive grid-based representations, ...
IEEE

A Topical Review of Quantum and Classical Machine Learning Approaches to Disaster Escape Routing Problems

Abstract: The pathfinding problem in a graph has been solved using several classical algorithms, notably Dijkstra’s and A* algorithms. However, most classical algorithms are most effective on static ...
GitHub

Guidance Graph Optimization for Lifelong Multi-Agent Path Finding

This repository is the official implementation of Guidance Graph Optimization for Lifelong Multi-Agent Path Finding, accepted to IJCAI 2024. The repository builds on top of the repository of ...