Build a plan from this source.

• [Re] Speedup Graph Processing by Graph Ordering →

  Lécuyer, Fabrice; Danisch, Maximilien; Tabourier, Lionel. [Re] Speedup Graph Processing by Graph Ordering. ReScience C 7(1), #3; 10.5281/zenodo.4836230.

  Record revision: 1d4cc94669701d57248cbb2f55a1f14ad014a73b5d8a963ee0dce0c3a5c24b6d

Source links open the current listing. This plan retains the revisions above; listing review does not grant permission to copy or adapt source files.

Before carrying out this plan

• Exact article-specific dependencies, data and build requirements remain uninspected.

Limits to keep in view

• No research code was executed; no independent scientific verification has been performed.
• The current qualified pilot is self-contained Python 3.13 with a 90-second author deadline. This article's environment has not been qualified for that path.
• Published source metadata and a historical review do not establish compatibility, successful reproduction, operator independence or current scientific correctness.
• The language/runtime named by the upstream source is outside the current qualified Python-only pilot.