Comparison of edge-finding and extended edge-finding filtering algorithms

Raw data from experiments reported in two forthcoming papers: quadratic edge-finding in the journal <em>Constraints</em>, and quadratic extended edge-finding in the <em>Int. J. of Planning and Scheduling</em>. Edge-finding is a filtering algorithm used in constraint-based scheduling, a relaxation of the NP-Hard cumulative resource constraint. Extended edge-finding is a related algorithm. We propse new O(n^2) algorithms for each of these two filtering algorithms, improving on previous results, and compare the effectiveness of our algorithm with the state-of-the-art in cumulative propagation techniques. Includes several figures omitted from publication.