Raw benchmark data for Scalable Quantum Walk-Based Heuristics for the Minimum Vertex Cover Problem

Three immutable raw CSV benchmark files for the major revision of Scalable Quantum Walk-Based Heuristics for the Minimum Vertex Cover Problem. The files contain archived Erdős–Rényi, Barabási–Albert, and regular graph edge lists, exact SageMath/Cliquer minimum vertex covers, CTQW outputs, classical baselines, runtimes, and graph descriptors. The versioned GitHub release contains the processing scripts, a 14,680-row canonical residual benchmark, metadata, tests, and the revised manuscript. Filenames, byte counts, filters, column meanings, and SHA-256 hashes are documented in the accompanying repository.