HPC acceleration of large (min, +) matrix products to compute domination-type parameters in graphs
<|reference_start|>HPC acceleration of large (min, +) matrix products to compute domination-type parameters in graphs: The computation of the domination-type parameters is a challenging problem in Cartesian product graphs. We present an algorithmic method to compute the $2$-domination number of the Cartesian product of a path with small order and any cycle, involving the $(\min,+)$ matrix product. We establish some theoretical results that provide the algorithms necessary to compute that parameter, and the main challenge to run such algorithms comes from the large size of the matrices used, which makes it necessary to improve the techniques to handle these objects. We analyze the performance of the algorithms on modern multicore CPUs and on GPUs and we show the advantages over the sequential implementation. The use of these platforms allows us to compute the $2$-domination number of cylinders such that their paths have at most $12$ vertices.<|reference_end|>
@article{garzón2024hpc,
    title={HPC acceleration of large (min, +) matrix products to compute
  domination-type parameters in graphs},
    author={E.M. Garz'on, J.A. Mart'inez, J.J. Moreno and M.L. Puertas},
    journal={Journal of Supercomputing 78, pp. 17826-17843, 2022},
    year={2024},
    doi={10.1007/s11227-022-04574-5},
    archivePrefix={arXiv},
    eprint={2409.17688},
    primaryClass={cs.DM math.CO}
}