Breadth-first search (BFS) is an essential graph traversal strategy widely used in computing applications. We introduce a parallelization strategy that allows the load balancing of computation resources as well as the execution of graph traversals in hybrid environments composed of CPUs and GPUs.