First deterministic subquadratic partially-dynamic algorithm for approximate APSP in directed graphs using reliable hub sets.
Improved dynamic reachabil ity algorithms for directed graphs
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
BDTS is a new data-structural framework for budgeted maintenance of rooted trace graphs, with Rust benchmarks showing compaction of 350k-2.71M tokens to 1k-4k tokens and model input reduction from ~3360 to ~432 tokens.
citing papers explorer
-
Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs
First deterministic subquadratic partially-dynamic algorithm for approximate APSP in directed graphs using reliable hub sets.
-
Budgeted Dynamic Trace Structures for Token-Efficient Sequential Computation
BDTS is a new data-structural framework for budgeted maintenance of rooted trace graphs, with Rust benchmarks showing compaction of 350k-2.71M tokens to 1k-4k tokens and model input reduction from ~3360 to ~432 tokens.