Algorithmic Research Overview on Graph Coloring Problems

被引：0
|
作者：
Song, Jiahuan [1 ]
Wang, Xiaofeng [1 ,2 ]
Hu, Simin [1 ]
Jia, Jingwei [1 ]
Yan, Dong [1 ]
机构：
[1] School of Computer Science and Engineering, North Minzu University, Yinchuan,750021, China
[2] Laboratory of Image & Graphics Intelligent Processing of State Ethnic Affairs Commission, North Minzu University, Yinchuan,750021, China
来源：
Computer Engineering and Applications | 2024年 / 60卷 / 18期
关键词：
64;
D O I：
10.3778/j.issn.1002-8331.2403-0434
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：66 / 77
相关论文
共 50 条
  • [1] Algorithmic graph minor theory: Decomposition, approximation, and coloring
    Demaine, ED
    Hajiaghayi, MT
    Kawarabayashi, KI
    [J]. 46TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2005, : 637 - 646
  • [2] On distance graph coloring problems
    de Freitas, Rosiane
    Dias, Bruno
    Maculan, Nelson
    Szwarcfiter, Jayme
    [J]. INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2021, 28 (03) : 1213 - 1241
  • [3] Data reduction for graph coloring problems
    Jansen, Bart M. P.
    Kratsch, Stefan
    [J]. INFORMATION AND COMPUTATION, 2013, 231 : 70 - 88
  • [4] Relaxation in graph coloring and satisfiability problems
    Svenson, P
    Nordahl, MG
    [J]. PHYSICAL REVIEW E, 1999, 59 (04) : 3983 - 3999
  • [5] Open Problems on Graph Coloring for Special Graph Classes
    Paulusma, Daniel
    [J]. GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2016, 9224 : 16 - 30
  • [6] Graph theoretic and algorithmic aspect of the equitable coloring problem in block graphs
    Furmanczyk, Hanna
    Mkrtchyan, Vahan
    [J]. DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2021, 23 (02):
  • [7] Asynchronous P systems for graph coloring problems
    Tanaka, Kohei
    Fujiwara, Akihiro
    [J]. 2012 THIRD INTERNATIONAL CONFERENCE ON NETWORKING AND COMPUTING (ICNC 2012), 2012, : 254 - 258
  • [8] Variations on memetic algorithms for graph coloring problems
    Moalic, Laurent
    Gondran, Alexandre
    [J]. JOURNAL OF HEURISTICS, 2018, 24 (01) : 1 - 24
  • [9] THE COMPLEXITY OF SOME GRAPH-COLORING PROBLEMS
    EDWARDS, K
    [J]. DISCRETE APPLIED MATHEMATICS, 1992, 36 (02) : 131 - 140
  • [10] Variations on memetic algorithms for graph coloring problems
    Laurent Moalic
    Alexandre Gondran
    [J]. Journal of Heuristics, 2018, 24 : 1 - 24
12345