Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Neff, Reece"'
Autor:
Ferdous, S M, Neff, Reece, Peng, Bo, Shuvo, Salman, Minutoli, Marco, Mukherjee, Sayak, Kowalski, Karol, Becchi, Michela, Halappanavar, Mahantesh
A coloring of a graph is an assignment of colors to vertices such that no two neighboring vertices have the same color. The need for memory-efficient coloring algorithms is motivated by their application in computing clique partitions of graphs arisi
Externí odkaz:
http://arxiv.org/abs/2401.06713
Autor:
Neff, Reece, Zarch, Mostafa Eghbali, Minutoli, Marco, Halappanavar, Mahantesh, Tumeo, Antonino, Kalyanaraman, Ananth, Becchi, Michela
Probabilistic breadth-first traversals (BPTs) are used in many network science and graph machine learning applications. In this paper, we are motivated by the application of BPTs in stochastic diffusion-based graph problems such as influence maximiza
Externí odkaz:
http://arxiv.org/abs/2311.10201
Over the past few years, there has been an increased interest in including FPGAs in data centers and high-performance computing clusters along with GPUs and other accelerators. As a result, it has become increasingly important to have a unified, high
Externí odkaz:
http://arxiv.org/abs/2208.11890