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 条
  • [41] Exact and Parameterized Algorithms for (k,i)- Coloring
    Majumdar, Diptapriyo
    Neogi, Rian
    Raman, Venkatesh
    Tale, Prafullkumar
    ALGORITHMS AND DISCRETE APPLIED MATHEMATICS, 2017, 10156 : 281 - 293
  • [42] ONLINE ALGORITHMS FOR 2-COLORING HYPERGRAPHS VIA CHIP GAMES
    ASLAM, JA
    DHAGAT, A
    THEORETICAL COMPUTER SCIENCE, 1993, 112 (02) : 355 - 369
  • [43] On approximation algorithms for coloring k-colorable graphs
    Xie, XZ
    Ono, T
    Hirata, T
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2003, E86A (05): : 1046 - 1051
  • [44] New algorithms for the minimum coloring cut problem
    Bordini, Augusto
    Protti, Fabio
    da Silva, Thiago Gouveia
    de Sousa Filho, Gilberto Farias
    INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2019, 26 (05) : 1868 - 1883
  • [45] NEW APPROXIMATION ALGORITHMS FOR GRAPH-COLORING
    BLUM, A
    JOURNAL OF THE ACM, 1994, 41 (03) : 470 - 516
  • [46] Parallel distance-k coloring algorithms for numerical optimization
    Gebremedhin, AH
    Manne, F
    Pothen, A
    EURO-PAR 2002 PARALLEL PROCESSING, PROCEEDINGS, 2002, 2400 : 912 - 921
  • [47] COLORING ALGORITHMS FOR K5-MINOR FREE GRAPHS
    KHULLER, S
    INFORMATION PROCESSING LETTERS, 1990, 34 (04) : 203 - 208
  • [48] New Multithreaded Ordering and Coloring Algorithms for Multicore Architectures
    Patwary, Md. Mostofa Ali
    Gebremedhin, Assefaw H.
    Pothen, Alex
    EURO-PAR 2011 PARALLEL PROCESSING, PT 2, 2011, 6853 : 250 - 262
  • [49] Some New Results on δ(k) -Coloring of Graphs
    Ellumkalayil M.T.
    Samuel L.C.
    Naduvath S.
    Journal of Interconnection Networks, 2023, 23 (03)
  • [50] New acyclic and star coloring algorithms with application to computing hessians
    Gebremedhin, Assefaw H.
    Tarafdar, Arijit
    Manne, Fredrik
    Pothen, Alex
    SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2007, 29 (03): : 1042 - 1072
12345