On the public citation graph

Compressing Optimal Paths with Run Length Encoding

0 signed · 70 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-319-07959-2_23openalex-snapshot
Customizable Contraction Hierarchies
inferredcites →https://doi.org/10.1007/978-3-319-49487-6_2openalex-snapshot
Route Planning in Transportation Networks
inferredcites →https://doi.org/10.1007/978-3-540-68552-4_24openalex-snapshot
Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks
inferredcites →https://doi.org/10.1007/978-3-642-13073-1_32openalex-snapshot
Preprocessing Speed-Up Techniques Is Hard
inferredcites →https://doi.org/10.1007/978-3-642-20662-7_20openalex-snapshot
A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks
inferredcites →https://doi.org/10.1007/978-3-642-33090-2_4openalex-snapshot
Hierarchical Hub Labelings for Shortest Paths
inferredcites →https://doi.org/10.1007/978-3-642-38527-8_7openalex-snapshot
Transit Node Routing Reconsidered
inferredcites →https://doi.org/10.1007/978-3-642-39206-1_9openalex-snapshot
Search-Space Size in Contraction Hierarchies
inferredcites →https://doi.org/10.1007/978-3-662-44777-2_27openalex-snapshot
Robust Distance Queries on Massive Networks
inferredcites →https://doi.org/10.1007/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
inferredcites →https://doi.org/10.1016/j.jpdc.2012.02.007openalex-snapshot
PHAST: Hardware-accelerated shortest path trees
inferredcites →https://doi.org/10.1016/j.tcs.2008.12.039openalex-snapshot
The simultaneous consecutive ones problem
inferredcites →https://doi.org/10.1090/dimacs/074openalex-snapshot
The Shortest Path Problem
inferredcites →https://doi.org/10.1090/dimacs/074/07openalex-snapshot
Ultrafast shortest-path queries via transit nodes
inferredcites →https://doi.org/10.1090/qam/102435openalex-snapshot
On a routing problem
inferredcites →https://doi.org/10.1109/tciaig.2012.2230632openalex-snapshot
Database-Driven Real-Time Heuristic Search in Video-Game Pathfinding
inferredcites →https://doi.org/10.1109/tciaig.2014.2337889openalex-snapshot
Fast Algorithm for Catching a Prey Quickly in Known and Partially Known Game Maps
inferredcites →https://doi.org/10.1109/tssc.1968.300136openalex-snapshot
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
inferredcites →https://doi.org/10.1137/0206004openalex-snapshot
Polynomial Complete Consecutive Information Retrieval Problems
inferredcites →https://doi.org/10.1137/1.9781611972870.5openalex-snapshot
In Transit to Constant Time Shortest-Path Queries in Road Networks
inferredcites →https://doi.org/10.1137/s0097539702403098openalex-snapshot
Reachability and Distance Queries via 2-Hop Labels
inferredcites →https://doi.org/10.1145/1097064.1097093openalex-snapshot
Efficient query processing on spatial networks
inferredcites →https://doi.org/10.1145/1989323.1989419openalex-snapshot
A memory efficient reachability data structure through bit vector compression
inferredcites →https://doi.org/10.1145/2424321.2424365openalex-snapshot
HLDB
inferredcites →https://doi.org/10.1145/2463676.2465315openalex-snapshot
Fast exact shortest-path distance queries on large networks by pruned landmark labeling
inferredcites →https://doi.org/10.1145/3544585.3544600openalex-snapshot
A Note on Two Problems in Connexion with Graphs
inferredcites →https://doi.org/10.1609/aaai.v25i1.7994openalex-snapshot
Online Graph Pruning for Pathfinding On Grid Maps
inferredcites →https://doi.org/10.1609/aaai.v28i1.8845openalex-snapshot
Identifying Hierarchies for Fast Optimal Search
inferredcites →https://doi.org/10.1609/aaai.v29i1.9368openalex-snapshot
Complexity Results for Compressing Optimal Paths
inferredcites →https://doi.org/10.1609/aiide.v7i1.12443openalex-snapshot
Ultra-Fast Optimal Pathfinding without Runtime Search
inferredcites →https://doi.org/10.1609/aiide.v8i1.12509openalex-snapshot
TRANSIT Routing on Video Game Maps
inferredcites →https://doi.org/10.1609/aiide.v8i1.12519openalex-snapshot
On Case Base Formation in Real-Time Heuristic Search
inferredcites →https://doi.org/10.1609/aimag.v35i3.2547openalex-snapshot
The Grid‐Based Path‐Planning Competition
inferredcites →https://doi.org/10.1609/icaps.v21i1.13488openalex-snapshot
Fast Subgoaling for Pathfinding via Real-Time Search
inferredcites →https://doi.org/10.1609/icaps.v23i1.13568openalex-snapshot
Subgoal Graphs for Optimal Pathfinding in Eight-Neighbor Grids
inferredcites →https://doi.org/10.1609/icaps.v23i1.13599openalex-snapshot
Moving Target Search with Compressed Path Databases
inferredcites →https://doi.org/10.1609/icaps.v23i1.13600openalex-snapshot
Path Planning with Compressed All-Pairs Shortest Paths Data
inferredcites →https://doi.org/10.1609/icaps.v24i1.13633openalex-snapshot
Improving Jump Point Search
inferredcites →https://doi.org/10.1609/socs.v3i1.18251openalex-snapshot
Fast, Optimal Pathfinding with Compressed Path Databases
inferredcites →https://doi.org/10.1609/socs.v5i1.18311openalex-snapshot
Fast First-Move Queries through Run-Length Encoding
inferredcites →https://doi.org/10.1609/socs.v6i1.18364openalex-snapshot
The Grid-Based Path Planning Competition: 2014 Entries and Results
inferredcites →https://doi.org/10.1613/jair.2241openalex-snapshot
Compressed Pattern Databases
inferredcites →https://doi.org/10.3233/978-1-58603-891-5-495openalex-snapshot
Compressing Pattern Databases with Learning
inferredcites →https://doi.org/10.48550/arxiv.1401.3905openalex-snapshot
MAPP: a Scalable Multi-Agent Path Planning Algorithm with Tractability and Completeness Guarantees
inferredcites →https://doi.org/10.48550/arxiv.1501.02492openalex-snapshot
On the Complexity of Hub Labeling
inferredcites →https://doi.org/10.48550/arxiv.1504.05140openalex-snapshot
Route Planning in Transportation Networks
inferredcites →https://doi.org/10.5555/545381.545503openalex-snapshot
Reachability and distance queries via 2-hop labels

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/s11280-023-01188-6openalex-snapshot
Efficiently computing alternative paths in game maps
inferred← citeshttps://doi.org/10.1016/j.artint.2021.103624openalex-snapshot
Fast optimal and bounded suboptimal Euclidean pathfinding
inferred← citeshttps://doi.org/10.1038/s44260-025-00049-9openalex-snapshot
Assembly theory and its relationship with computational complexity
inferred← citeshttps://doi.org/10.1080/13682199.2019.1565695openalex-snapshot
Binary medical image compression using the volumetric run-length approach
inferred← citeshttps://doi.org/10.1088/1741-2552/ad48baopenalex-snapshot
A feature enhanced EEG compression model using asymmetric encoding–decoding network *
inferred← citeshttps://doi.org/10.1109/i2mtc66907.2026.11694634openalex-snapshot
Collision Detection and Penetration Depth Measurement by Interval-Based Binary Encoding of Robot, Obstacle Images
inferred← citeshttps://doi.org/10.11591/ijece.v12i3.pp2601-2613openalex-snapshot
Combining 3D run-length encoding coding and searching techniques for medical image compression
inferred← citeshttps://doi.org/10.1609/icaps.v27i1.13812openalex-snapshot
Compressed Path Databases with Ordered Wildcard Substitutions
inferred← citeshttps://doi.org/10.1609/icaps.v29i1.3465openalex-snapshot
Cutting the Size of Compressed Path Databases with Wildcards and Redundant Symbols
inferred← citeshttps://doi.org/10.1609/icaps.v31i1.15977openalex-snapshot
Contracting and Compressing Shortest Path Databases
inferred← citeshttps://doi.org/10.1609/socs.v10i1.18509openalex-snapshot
Repairing Compressed Path Databases on Maps with Dynamic Changes
inferred← citeshttps://doi.org/10.1609/socs.v12i1.18554openalex-snapshot
Customised Shortest Paths Using a Distributed Reverse Oracle
inferred← citeshttps://doi.org/10.1609/socs.v9i1.18454openalex-snapshot
Forward Search in Contraction Hierarchies
inferred← citeshttps://doi.org/10.1613/jair.1.12255openalex-snapshot
Regarding Goal Bounding and Jump Point Search
inferred← citeshttps://doi.org/10.24963/ijcai.2018/198openalex-snapshot
The FastMap Algorithm for Shortest Path Computations
inferred← citeshttps://doi.org/10.24963/ijcai.2018/209openalex-snapshot
Understanding Subgoal Graphs by Augmenting Contraction Hierarchies
inferred← citeshttps://doi.org/10.24963/ijcai.2019/167openalex-snapshot
Path Planning with CPD Heuristics
inferred← citeshttps://doi.org/10.24963/ijcai.2020/584openalex-snapshot
Euclidean Pathfinding with Compressed Path Databases
inferred← citeshttps://doi.org/10.3233/aic-170743openalex-snapshot
The compressed differential heuristic
inferred← citeshttps://doi.org/10.3390/app11125340openalex-snapshot
Path Planning Method for UAVs Based on Constrained Polygonal Space and an Extremely Sparse Waypoint Graph
inferred← citeshttps://doi.org/10.3390/electronics7120375openalex-snapshot
A Fast Global Flight Path Planning Algorithm Based on Space Circumscription and Sparse Visibility Graph for Unmanned Aerial Vehicle
inferred← citeshttps://doi.org/10.3390/sym12071186openalex-snapshot
Exploiting Obstacle Geometry to Reduce Search Time in Grid-Based Pathfinding
inferred← citeshttps://doi.org/10.54105/ijcns.a1427.04021124openalex-snapshot
A Comprehensive Methodology for Data Compression and Decompression Utilizing Huffman Coding, LZW Compression, and RunLength Encoding, Integrated with Data Encryption Standard (DES) and Advanced Encryption Standard (AES) for Enhanced Security
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.