ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “Graph-verifiable mobility decisions”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.CVEmpiricalRecentJun 21, 2026

MapReason-OSM: Can Vision-Language Models Make Graph-Verifiable Mobility Decisions from Street Maps ?

Srinivas Venkatanarayanan, Clement Pakkam Isaac

The authors present a benchmark and evaluation harness for graph-verifiable mobility decisions on self-rendered OpenStreetMap panels.

View →
cs.NIEmpiricalRecentJul 27, 2026

Methods for Path Set Attribute Calculation in Network Systems

Giovanni Fiaschi, Carlo Vitucci, Thomas Westerbäck, Daniel Sundmark +1 more

This paper presents an optimized algorithm for computing cut sets of a path set in graph theory and introduces a vectorized computational framework for property calculations.

View →
cs.MAcs.LOTheoreticalRecentJun 19, 2026

Monitoring Diameters of Causal Communication Graph with Spatio-Temporal Logic

Lydia Bakiri, Jérémy Dubut, Sergio Mover

The paper introduces an extension of muTGL logic with a new operator called the space horizon to improve expressiveness for analyzing reachability and communication chains in multi-agent systems.

View →
cs.NITheoreticalRecentJul 29, 2026

Can We Trust AI in 6G? Verifiable and Auditable AI-Driven Trustworthy Wireless Networks

Genze Jiang, Yizhou Huang, Kezhi Wang

This paper proposes a mechanical auditing approach for verifying AI functions in wireless networks using machine-verifiable specifications.

View →
math.OCcs.CCcs.DMRecentMay 29, 2026

Diffusion-Robust Optimization over Graphs

Liviu Aolaritei, Ricky Huang, Michael I. Jordan, Paul Grigas

The paper introduces a diffusion-based uncertainty model for robust optimization on graphs, showing that the resulting computational complexity depends critically on the interaction between the uncert…

View →
cs.DSmath.COmath.OCTheoreticalRecentJun 12, 2026

Designing Efficient and Reachable Routes: The $k$-Step-Central Shortest Path Problem

Johnson Phosavanh, Dmytro Matsypura

This paper introduces the $k$-Step-Central Shortest Path problem to maximize reachability in transportation networks and provides a polynomial-time algorithm for unweighted graphs.

View →
cs.MAEmpiricalRecentJun 23, 2026

Generating Realistic Individual Activity Schedules via Activity Location Allocation Based on Simulated Travel Times

Tatsuya Mitomi, Yahya Gamal, Esra Suel, Gary Polhill +2 more

The paper proposes a framework for generating realistic individual level daily activity schedules that preserve travel times consistent with those reported in travel surveys.

View →
cs.NIcs.MAEmpiricalRecentSep 23, 2026

From Intents to Algorithms: Verified Algorithm Discovery for Transport Networks

Behnam Ojaghi, Ricard Vilalta, Raul Muñoz

This paper presents VERA-TN, a verification-guided framework that uses a large language model to automate algorithm design for network intent.

View →
cs.NIEmpiricalRecentJun 23, 2026

Overconfident Coordinates: Quantifying Confidence in Traceroute Geolocation

Santiago Klein, Caleb J. Wang, Fabián E. Bustamante

This paper introduces Path Consistency Scoring (PCS), a framework that evaluates router geolocation as a path-level consistency problem and produces a path consistency score based on a Hidden Markov M…

View →
cs.DMmath.PRTheoreticalRecentJul 26, 2026

Stability in stochastic hypergraph matching I: necessary and sufficient criteria

Doan Dai Nguyen, Ana Bušić

This paper introduces online assignment policies for stochastic matching on hypergraphs, which are maximally stable and allow for the derivation of necessary and sufficient stability criteria.

View →
cs.CCcs.DMcs.DSTheoreticalRecentJul 3, 2026

Edge Geography is XNLP-hard for Pathwidth and in XP for Tree-Partition Width

Thobias Kvalvik Høivik, Erlend Raa Vågset

The paper proves XNLP-hardness of Directed Edge Geography and Undirected Edge Geography when parameterized by pathwidth, and shows their fixed-parameter tractability when parameterized by treewidth an…

View →
cs.DSTheoreticalRecentJun 16, 2026

Reducing Prize-Collecting Stroll and Related Routing Problems to Prize-Collecting TSP

Hong Li

This paper improves the approximation algorithm for the prize-collecting stroll problem.

View →
cs.AIcs.HCcs.ROEmpiricalRecentJun 24, 2026

Reasonable Motion: A General ASP Foundation for Environment Constrained Movement Trajectory Computation

Julius Monsen, Jakob Suchan, Mehul Bhatt, Lars Karlsson

A hybrid method for computing constrained branching trajectory modes for moving objects in real-world settings using answer set programming.

View →
cs.AIRecentMay 27, 2026

VeriTrip: A Verifiable Benchmark for Travel Planning Agents over Unstructured Web Corpora

Yuting Xu, Jiayi Tian, Jian Liang, Xin Xiong +3 more

The paper introduces VeriTrip, a new verifiable benchmark that evaluates travel planning agents' ability to perform evidence-grounded reasoning over complex, unstructured, and multimodal web data, rev…

View →
cs.CLcs.AIcs.MAEmpiricalRecentJun 11, 2026

When Plausible Is Not Realistic: Evaluating Human Mobility in LLM-Based Urban Simulation

Gustavo H. Santos, Aline Carneiro Viana, Thiago H. Silva

The paper introduces a validation framework to evaluate the realism of LLM-based generative agents in urban simulators against real-world mobility data.

View →
cs.LGcs.AIRecentJun 1, 2026

CityTrajBench: A Unified Benchmark for City-Scale Vehicle Trajectory Generation

Shibo Zhu, Xiaodan Shi, Dayin Chen, Yuntian Chen +3 more

The paper introduces CityTrajBench, a unified benchmark framework that standardizes the evaluation of city-scale vehicle trajectory generation, demonstrating that no single generation model dominates…

View →