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 t...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	The Journal of supercomputing 2022-11, Vol.78 (16), p.17826-17843
Hauptverfasser:	Garzón, Ester M., Martínez, José Antonio, Moreno, Juan José, Puertas, María Luz
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Apexes Cartesian coordinates CMMSE- Computational and Mathematical methods Compilers Computer Science Graphs Interpreters Parameters Processor Architectures Programming Languages
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!