Abstract: Breadth-first search (BFS) is a fundamental building block of various high-performance computing applications beyond graph analysis and also known as a benchmark problem in the Graph 500 ...
Abstract: Control flow graph models program execution paths and is essential for program analysis and compiler optimizations. Compilers traverse thousands of graphs during compilation, thus, efficient ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback