Cover Image

HPC acceleration of large (min, +) matrix products to compute domination-type parameters in graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Garzón, E. M., Martínez, J. A., Moreno, J. J., Puertas, M. L.
Format:	Preprint
Published:	2024
Subjects:	Discrete Mathematics Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Powers of large matrices on GPU platforms to compute the Roman domination number of cylindrical graphs
by: Martínez, J. A., et al.
Published: (2024)

Secure domination in $P_5$-free graphs
by: Gupta, Uttam K., et al.
Published: (2025)

On open-separating dominating codes in graphs
by: Chakraborty, Dipayan, et al.
Published: (2024)

The 1/3-conjectures for domination in cubic graphs
by: Dorbec, Paul, et al.
Published: (2024)

On graph classes with constant domination-packing ratio
by: Bonamy, Marthe, et al.
Published: (2025)

Vertex-edge domination on subclasses of bipartite graphs
by: Pandey, Arti, et al.
Published: (2025)

On three domination-based identification problems in block graphs
by: Chakraborty, Dipayan, et al.
Published: (2018)

Tree-independence number of $P_5$-free graphs with no large bicliques
by: Blažej, Václav, et al.
Published: (2026)

Equitable coloring of large bipartite graphs
by: Nikabadi, Amir
Published: (2026)

Relation between broadcast domination and multipacking numbers on chordal and other hyperbolic graphs
by: Das, Sandip, et al.
Published: (2023)

Immersions of large cliques in graphs with independence number 2 and bounded maximum degree
by: Botler, Fábio, et al.
Published: (2025)

On core of categorical product of (di)graphs
by: Naserasr, Reza, et al.
Published: (2025)

Minimum length word-representants of graph products
by: Srinivasan, Eshwar, et al.
Published: (2024)

On $(n,m)$-chromatic numbers of graphs having bounded sparsity parameters
by: Das, Sandip, et al.
Published: (2023)

EPPA numbers of graphs
by: Bradley-Williams, David, et al.
Published: (2023)

Star colouring and locally constrained graph homomorphisms
by: Antony, Cyriac, et al.
Published: (2023)

On graphs with a simple structure of maximal cliques
by: Gollin, J. Pascal, et al.
Published: (2025)

Three-dimensional graph products with unbounded stack-number
by: Eppstein, David, et al.
Published: (2022)

The 2-domination number of cylindrical graphs
by: Martínez, José Antonio, et al.
Published: (2024)

Disjunctive domination in maximal outerplanar graphs
by: Henning, Michael A., et al.
Published: (2025)

Roman domination in weighted graphs
by: Cera, Martín, et al.
Published: (2025)

Oriented discrepancy of Hamilton cycles in oriented graphs satisfying Ore-type condition
by: Ai, Jiangdong, et al.
Published: (2025)

Enumerating minimal dominating sets and variants in chordal bipartite graphs
by: Castelo, Emanuel, et al.
Published: (2025)

Hamiltonian connectivity of some base-cobase graphs
by: Martínez-Sandoval, Leonardo, et al.
Published: (2025)

Progress towards the two-thirds conjecture on locating-total dominating sets
by: Chakraborty, Dipayan, et al.
Published: (2022)

A Brooks-type theorem for the k-choosability of graphs with maximum local edge-connectivity k
by: Bastida, Sam, et al.
Published: (2026)

Optimal local identifying and local locating-dominating codes
by: Herva, Pyry, et al.
Published: (2023)

Extremal digraphs for open neighbourhood location-domination and identifying codes
by: Foucaud, Florent, et al.
Published: (2023)

Locating-dominating partitions for some classes of graphs
by: Foucaud, Florent, et al.
Published: (2025)

Profile and neighbourhood complexity of graphs excluding a minor and tree-structured graphs
by: Beaudou, Laurent, et al.
Published: (2025)

Trees and co-trees in planar 3-connected graphs An easier proof via Schnyder woods
by: Ortlieb, Christian, et al.
Published: (2024)

Hamiltonicity of Schrijver graphs and stable Kneser graphs
by: Mütze, Torsten, et al.
Published: (2024)

On universal graphs for trees and treewidth $k$ graphs
by: Kaul, Neel, et al.
Published: (2025)

Planar cycle-extendable graphs
by: Dalwadi, Aditya Y, et al.
Published: (2024)

The treewidth and pathwidth of graph unions
by: Alecu, Bogdan, et al.
Published: (2022)

Vertex-critical graphs in co-gem-free graphs
by: Beaton, Iain, et al.
Published: (2024)

Effects of graph operations on star pairwise compatibility graphs
by: Monti, Angelo, et al.
Published: (2024)

Determining a graph from its reconfiguration graph
by: Berthe, Gaétan, et al.
Published: (2025)

The sandwich problem for odd-hole-free and even-hole-free graphs
by: Cameron, Kathie, et al.
Published: (2024)

An improved upper bound for the domination number of a graph
by: Arumugam, Subramanian, et al.
Published: (2024)