Efficient Catalytic Graph Algorithms¶
Cook, J., & Pyne, E. (2026). Efficient Catalytic Graph Algorithms. Leibniz International Proceedings in Informatics, 1-1.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Catalytic computing
- The borrowed memory is useful precisely because temporary modification can aid the calculation without consuming its original data.
This sourceTheorem 2 has smaller catalytic-space use without the same local-revertibility claim; Theorem 18 is a separate reduced-register branch.
- The borrowed memory is useful precisely because temporary modification can aid the calculation without consuming its original data.
Verification¶
Does it exist? Not checked yet. This work's DOI is recorded above but has not been resolved against an external catalogue, so nothing here confirms the work exists.
Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Links previously used in the corpus¶
Before the registry existed this work was also linked 1 other way.
Registry ID ref:36896ff774c1 · see in the full table