Language and Hardware Acceleration Backend for Graph Processing Andrey Mokhov† , Alessandro de Gennaro† , Ghaith Tarawneh† , Jonny Wray‡ , Georgy Lukyanov† , Sergey Mileiko† , Joe Scott† , Alex Yakovlev†

First Page		Document Content
Date: 2017-08-19 21:07:39 Graph theory Mathematics Discrete mathematics Graph traversal Graph Directed graph Breadth-first search Degree Line graph Clique		Language and Hardware Acceleration Backend for Graph Processing Andrey Mokhov† , Alessandro de Gennaro† , Ghaith Tarawneh† , Jonny Wray‡ , Georgy Lukyanov† , Sergey Mileiko† , Joe Scott† , Alex Yakovlev† Add to Reading List Source URL: www.staff.ncl.ac.uk Download Document from Source Website File Size: 334,84 KB Share Document on Facebook

	Understanding Resolution Proofs through Herbrand’s Theorem‹ Stefan Hetzl1 , Tomer Libal2 , Martin Riener3 , and Mikheil Rukhaia4 1 Institute of Discrete Mathematics and Geometry, Vienna University of Technology DocID: 1xTCQ - View Document
	Using Alloy in a Language Lab Approach to Introductory Discrete Mathematics Charles Wallace Michigan Technological University In collaboration with Laura Brown, Adam Feltz DocID: 1xTvc - View Document
	Applicable Analysis and Discrete Mathematics available online at http://pefmath.etf.bg.ac.yu Appl. Anal. Discrete Math), 322–337. doi:AADM100425018H DocID: 1vmuF - View Document
	Discrete Mathematics and Theoretical Computer Science DMTCS vol. (subm.), by the authors, 1–1 A lower bound for approximating the grundy number DocID: 1vkug - View Document
	Hausdorﬀ Center for Mathematics, Summer School (May 9–13, 2016) Problems for “Discrete Convex Analysis” (by Kazuo Murota) Problem 1. Prove that a function f : Z2 → R defined by f (x1 , x2 ) = φ(x1 − x2 ) is DocID: 1vjVY - View Document