Digraph k-Coloring Games: New Algorithms and Experiments

被引：0
|
作者：
D'Ascenzo, Andrea [1 ]
D'Emidio, Mattia [2 ]
Flammini, Michele [3 ,4 ]
Monaco, Gianpiero [5 ]
机构：
[1] Luiss University, Viale Romania 32, Rome,00197, Italy
[2] Dept. of Information Engineering Computer Science and Mathematics, University of L'Aquila, Via Vetoio snc, L'Aquila,67100, Italy
[3] Dept. of Computer Science, Gran Sasso Science Institute, Viale F. Crispi 7, L'Aquila,67100, Italy
[4] Dept. of Mathematics and Computer Science, University of Calabria, Via P. Bucci, CS, Arcavacata di Rende,87036, Italy
[5] Dept. of Economic Studies, University of Chieti-Pescara, Viale Pindaro, Pescara,65127, Italy
来源：
Journal of Artificial Intelligence Research | 2024年 / 81卷
关键词：
Preliminary versions of the results presented in this paper have appeared in (Carosi; Flammini; Monaco; 2017; D'Ascenzo; D'Emidio; 2022). Most of Andrea D'Ascenzo's work was carried out during his Ph.D. studies at University of L'Aquila. This work was partially supported by: (i) Italian Ministry of University and Research through Project "EXPAND: scalable algorithms for EXPloratory Analyses of heterogeneous and dynamic Networked Data\"" (PRIN grant n. 2022TS4Y3N);
D O I：
暂无
中图分类号：
学科分类号：
摘要：
62
引用
收藏
页码：163 / 202
相关论文
共 50 条
  • [21] An adaptive memory algorithm for the k-coloring problem
    Galinier, Philippe
    Hertz, Alain
    Zufferey, Nicolas
    DISCRETE APPLIED MATHEMATICS, 2008, 156 (02) : 267 - 279
  • [22] A special k-coloring for a connected k-chromatic graph
    Chen, GT
    Schelp, RH
    Shreve, WE
    DISCRETE MATHEMATICS, 1997, 170 (1-3) : 231 - 236
  • [23] Virtual Structure Reduction on Distributed k-Coloring Problems
    Gemelli, Nathaniel
    Hudack, Jeffrey
    Oh, Jae C.
    2013 IEEE/WIC/ACM INTERNATIONAL CONFERENCE ON INTELLIGENT AGENT TECHNOLOGY (IAT 2013), 2013, : 46 - 52
  • [24] Special k-coloring for a connected k-chromatic graph
    Chen, G.
    Schelp, R.H.
    Shreve, W.E.
    Discrete Mathematics, 1997, 170 (1-3):
  • [25] A study of evaluation functions for the graph K-coloring problem
    Porumbel, Daniel Cosmin
    Hao, Jin-Kao
    Kuntz, Pascale
    ARTIFICIAL EVOLUTION, 2008, 4926 : 124 - +
  • [26] On characterizing radio k-coloring problem by path covering problem
    Sarkar, Ushnish
    Adhikari, Avishek
    DISCRETE MATHEMATICS, 2015, 338 (04) : 615 - 620
  • [27] On r-dynamic k-coloring of ladder graph families
    Irin Feno, A.
    Venkatachalam, M.
    Rathour, Laxmi
    Cangul, I. N.
    Abirami, K.
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2024,
  • [28] An improved transiently chaotic neural network for solving the K-coloring problem
    Gu, SS
    ADVANCES IN NEURAL NETWORKS - ISNN 2005, PT 1, PROCEEDINGS, 2005, 3496 : 750 - 755
  • [29] Grobner bases techniques for an S-packing k-coloring of a graph
    Maarouf, Hamid
    ELECTRONIC JOURNAL OF COMBINATORICS, 2017, 24 (03):
  • [30] Improved complexity results on k-coloring Pt-free graphs
    Huang, Shenwei
    EUROPEAN JOURNAL OF COMBINATORICS, 2016, 51 : 336 - 346
12345