There are Trillions of Little Forks in the Road. Choose Wisely! - Estimating the Cost and Likelihood of Success of Constrained Walks to Optimize a Graph Pruning Pipeline

Article Details
Title:	There are Trillions of Little Forks in the Road. Choose Wisely! - Estimating the Cost and Likelihood of Success of Constrained Walks to Optimize a Graph Pruning Pipeline
Article URLs:	https://doi.org/10.1109/IA3.2018.00010
Alternative Article URLs:
Authors:	Nicolas Tripoul	University of British Columbia, Department of Electrical and Computer Engineering
	Hassan Halawa	University of British Columbia, Department of Electrical and Computer Engineering
	Tahsin Reza	University of British Columbia, Department of Electrical and Computer Engineering
	Geoffrey Sanders	Lawrence Livermore National Laboratory, Center for Applied Scientific Computing
	Roger Pearce	Lawrence Livermore National Laboratory, Center for Applied Scientific Computing
	Matei Ripeanu	University of British Columbia, Department of Electrical and Computer Engineering
Sharing:	Unknown
Verification:	Authors have not verified information
Artifact Evaluation Badge:	Artifacts for some papers are reviewed by an artifact evaluation, reproducibility, or similarly named committee. This is one such paper that passed review. awarded
Artifact URLs:	http://www.ece.ubc.ca/∼matei/papers/ia3-nicolas-full.pdf https://github.com/tahsinreza/pattenmatching_sharedmemory
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key:	conf/sc/TripoulHRSPR18
Author Comments:

ACM/IEEE Workshop on Irregular Applications: Architectures and Algorithms, IA3 2018