Research map / Graph learning / Graph algorithms and clustering
Sublinear Search Spaces for Shortest Path Planning in Grid and Road Networks
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Paths, Proofs, and Perfection: Developing a Human-Interpretable Proof System for Constrained Shortest Paths (AAAI 2024 · similarity 0.86)
- Efficient Fault-Tolerant Search by Fast Indexing of Subnetworks (AAAI 2025 · similarity 0.85)
- Solving Multiagent Path Finding on Highly Centralized Networks (AAAI 2025 · similarity 0.85)
- Resource Constrained Pathfinding with Enhanced Bidirectional A* Search (AAAI 2025 · similarity 0.85)
- How Many Lines to Paint the City: Exact Edge-Cover in Temporal Graphs (AAAI 2025 · similarity 0.85)
- Exact Algorithms and Lowerbounds for Multiagent Path Finding: Power of Treelike Topology (AAAI 2024 · similarity 0.85)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.