z-logo
open-access-imgOpen Access
The fastest and energy-efficient breadth-first search algorithm on a single node with various parallel architectures according to Graph500
Publication year - 2018
Publication title -
bulletin of the south ural state university series computational mathematics and software engineering
Language(s) - English
Resource type - Journals
eISSN - 2410-7034
pISSN - 2305-9052
DOI - 10.14529/cmse180201
Subject(s) - traverse , computer science , parallel computing , breadth first search , graph , algorithm , sorting , benchmark (surveying) , graph layout , theoretical computer science , graph drawing , geodesy , geography

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom