WRSWorld Research StateContribute
WORLD RESEARCH STATE

Arlazarov, Dinitz, Kronrod and Faradzhev: faster graph reachability through subset tabulation

Contribution grade

Computing · Computing

Reference score120,000Provisional editorial estimate of this exact contribution; its grade is assessed separately.

What changed

Arlazarov, Dinitz, M.A.Kronrod and Faradzhev tabulated unions over small blocks of intermediate vertices to compute Boolean relation products and acyclic graph closure in O(n^3/ln n) elementary operations.

Scientific scope

Arlazarov, Dinitz, M.A.Kronrod and Faradzhev tabulated unions over small blocks of intermediate vertices to compute Boolean relation products and acyclic graph closure in O(n^3/ln n) elementary operations. The original direct result concerns acyclic graph closure with O(n^3/log n) elementary operations and table lookup; general graphs require the cited condensation/rank reductions. Lookup, storage and bit-operation assumptions remain part of the computational model. This account follows a transcription of the short original; it does not supply a certified formula transcription or independent proof reconstruction. Finite examples do not certify the complete asymptotic argument or a modern runtime benchmark. M. A. Kronrod is Mikhail Kronrod.

Evidence

Source-linked, scoped account of the original work. The published scope states the scientific assumptions and remaining verification limits. WRS has not independently certified the full proof, experimental result or system benchmark.

Contributors

Provisional WRS assessment, edition 2026-10-16.1. Independent expert calibration is pending. This grade does not certify correctness or assign ownership.

Full scientific record · Browse contribution grades · Request a correction