{"id":"1805.05208","title":"Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable","url":"https://codeofpaper.com/paper/1805.05208","arxiv_url":"https://arxiv.org/abs/1805.05208","published":"2018-05-14","code":"official","best":{"full_name":"ParAlg/gbbs","url":"https://github.com/ParAlg/gbbs","tier":"official","stars":225,"license":"MIT","framework":null,"language":"C++","last_commit":"2026-10-11T21:19:55"},"most_starred_community":null,"implementations":[{"full_name":"ParAlg/gbbs","url":"https://github.com/ParAlg/gbbs","tier":"official","stars":225,"license":"MIT","framework":null,"language":"C++","last_commit":"2026-10-11T21:19:55"}],"possible_matches":0}