reachqDocumentation
GitHub
19 / research

Research provenance

How the implementation relates to the cited paper, engineering refinements, and experimental work.

Edit this pageUpdated with the source

Supported implementation

The core constructions are informed by Parallel Reachability and Shortest Paths on Non-sparse Digraphs by Ashvinkumar, Bernstein, Probst Gutenberg, and Saranurak.

Three different claims

  • A theorem in the paper is a literature result under its assumptions.
  • A reachq implementation is the behavior exercised by its code and tests.
  • A benchmark is a measurement for a specified graph, machine, commit, and parameter set.

Read the provenance notes ↗ and archive for historical context.