The inapproximability for the (0,1)-additive number
From MaRDI portal
Publication:2816507
zbMath1343.05128arXiv1306.0182MaRDI QIDQ2816507
Publication date: 23 August 2016
Full work available at URL: https://arxiv.org/abs/1306.0182
computational complexity\((0, 1)\)-additive labeling\((0, 1)\)-additive numberadditive labelingadditive numberlucky number
Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (6)
Additive list coloring of planar graphs with given girth ⋮ Is there any polynomial upper bound for the universal labeling of graphs? ⋮ Algorithmic complexity of weakly semiregular partitioning and the representation number ⋮ Planar graphs with girth 20 are additively 3-choosable ⋮ Automatic tracking and positioning algorithm for moving targets in complex environment ⋮ EMD and GNN-adaboost fault diagnosis for urban rail train rolling bearings
This page was built for publication: The inapproximability for the (0,1)-additive number
