The core of a graph

Data-intensive applications have drawn more and more attention in the last few years. The basic graph traversal algorithm, the breadth-first search (BFS), a typical data-intensive application, is widely used and the Graph 500 benchmark uses it to rank ...

Let $$G$$G be a graph. The core of $$G$$G, denoted by $$G_{\Delta }$$GΔ, is the subgraph of $$G$$G induced by the vertices of degree $$\Delta (G)$$Δ(G), where $$\Delta (G)$$Δ(G) denotes the maximum degree of $$G$$G. A $$k$$k-edge coloring of $$G$$G is a ...

Wave propagation forward modeling is a widely used computational method in oil and gas exploration. The iterative stencil loops in such problems have broad applications in scientific computing. However, executing such loops can be highly time-consuming, ...