scientific article; zbMATH DE number 7058477

zbMath1411.05245arXiv1708.00758MaRDI QIDQ5377234

Julien Darlay, Julien Moncel, Marwane Bouznif, Myriam Preissmann

Publication date: 23 May 2019

Full work available at URL: https://arxiv.org/abs/1708.00758

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

graph algorithmgrididentifying codelocating-dominating codelocating-total-dominating code

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Theory of error-correcting codes and error-detecting codes (94B99)

Related Items (5)

A constant time algorithm for some optimization problems in rotagraphs and fasciagraphs ⋮ The general position number of integer lattices ⋮ Spy game: FPT-algorithm, hardness and graph products ⋮ Spy game: FPT-algorithm and results on graph products ⋮ Perfect domination ratios of Archimedean lattices

This page was built for publication: