Tech Xplore on MSN

Shortest paths research narrows a 25-year gap in graph algorithms

Most of you have used a navigation app like Google Maps for your travels at some point. These apps rely on algorithms that ...
IEEE

Fully Distributed Path Planning and Bipartite Formation Tracking for Multiple Euler-Lagrange Agents with Faults and Input Saturation

Abstract: This paper addresses the path planning and bipartite formation tracking (BFT) problem for multiple Euler-Lagrange agents (MELAs) subject to actuator faults and input saturation. A fully ...
IEEE

Permutation Entropy for Time Series Over n-Distance Path Graphs

Abstract: Permutation entropy (PE) is a widely used metric for quantifying the complexity of time series data. Recent efforts have extended PE to graph signals, resulting in the graph permutation ...
GitHub

Godskid89/path-constrained-retrieval

Path-Constrained Retrieval (PCR) is a novel retrieval method that combines structural graph constraints with semantic search to improve the reliability and consistency of LLM agent reasoning. Unlike ...
GitHub

A powerful Go codebase analyzer that transforms code into explorable graphs, enabling AI assistants to understand complex codebases through the Model Context Protocol (MCP).

What is Go Code Graph? Go Code Graph analyzes Go source code to create a comprehensive graph representation of your codebase structure, including packages, types, functions, and their relationships.