Algorithmic complexity of proper labeling problems

被引：29

作者：

Dehghan, Ali ^{[1
]}

Sadeghi, Mohammad-Reza ^{[1
]}

Ahadi, Arash ^{[2
]}

机构：

[1] Amirkabir Univ Technol, Fac Math & Comp Sci, Tehran, Iran

[2] Sharif Univ Technol, Dept Math Sci, Tehran, Iran

来源：

THEORETICAL COMPUTER SCIENCE | 2013年 / 495卷

关键词：

Proper labeling; Computational complexity; Multiplicative vertex-coloring weightings; Gap vertex-distinguishing edge colorings; Fictional coloring; Vertex-labeling by maximum; 1; 2; 3-Conjecture; Multiplicative; 3-conjecture; VERTEX; WEIGHTINGS; NUMBER; GRAPHS;

D O I：

10.1016/j.tcs.2013.05.027

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

A proper labeling of a graph is an assignment of integers to some elements of a graph, which may be the vertices, the edges, or both of them, such that we obtain a proper vertex coloring via the labeling subject to some conditions. The problem of proper labeling offers many variants and received a great interest during recent years. We consider the algorithmic complexity of some variants of the proper labeling problems, we present some polynomial time algorithms and NP-completeness results for them. (C) 2013 Elsevier B.V. All rights reserved.

引用

页码：25 / 36

页数：12

共 50 条

[1] THE COMPLEXITY AND REDUCIBILITY OF ALGORITHMIC MASS PROBLEMS
KANOVICH, MI
[J]. DOKLADY AKADEMII NAUK SSSR, 1983, 272 (02): : 289 - 293
[2] Algorithmic complexity of two defence budget problems
Taylor, R.
[J]. 21ST INTERNATIONAL CONGRESS ON MODELLING AND SIMULATION (MODSIM2015), 2015, : 809 - 815
[3] ESTIMATES OF COMPLEXITY OF ALGORITHMIC PROBLEMS OF CONSTRUCTIVE ANALYSIS
SHURYGIN, VA
[J]. DOKLADY AKADEMII NAUK SSSR, 1977, 233 (06): : 1064 - 1067
[4] Algorithmic Complexity of Mathematical Problems: An Overview of Results and Open Problems
Calude, Cristian S.
Calude, Elena
[J]. INTERNATIONAL JOURNAL OF UNCONVENTIONAL COMPUTING, 2013, 9 (3-4) : 327 - 343
[5] The algorithmic complexity of bondage and reinforcement problems in bipartite graphs
Hu, Fu-Tao
Sohn, Young
[J]. THEORETICAL COMPUTER SCIENCE, 2014, 535 : 46 - 53
[6] On the algorithmic complexity of some numeration-related problems
Boka, David
Burcsi, Peter
Uray, M. Janos
[J]. PUBLICATIONES MATHEMATICAE-DEBRECEN, 2021, 98 (1-2): : 65 - 81
[7] Algorithmic Profiling for Real-World Complexity Problems
Qin, Boqin
Tu, Tengfei
Liu, Ziheng
Yu, Tingting
Song, Linhai
[J]. IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 2021, 48 (07) : 2680 - 2694
[8] CONVEXITY AND ALGORITHMIC COMPLEXITY OF THE SOLUTIONS OF POLYNOMIAL PROGRAMMING-PROBLEMS
KHACHIYAN, LG
[J]. ENGINEERING CYBERNETICS, 1982, 20 (06): : 1 - 10
[9] Algorithmic and complexity aspects of problems related to total restrained domination for graphs
Yu Yang
Cai-Xia Wang
Shou-Jun Xu
[J]. Journal of Combinatorial Optimization, 2023, 46
[10] Algorithmic and complexity aspects of problems related to total Roman domination for graphs
Abolfazl Poureidi
Nader Jafari Rad
[J]. Journal of Combinatorial Optimization, 2020, 39 : 747 - 763

← 1 2 3 4 5 →