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 条
  • [31] Nonconvex Quadratic Programming Method for k－Coloring Problem：Algorithm and Computation
    Cao Jiaming(Department of Transportation Engineering)
    Railway Engineering Science, 1994, (02) : 138 - 145
  • [32] Improved Complexity Results on k-Coloring Pt-Free Graphs
    Huang, Shenwei
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2013, 2013, 8087 : 551 - 558
  • [33] A Linear Algorithm for Radio k-Coloring Powers of Paths Having Small Diameter
    Chakraborty, Dipayan
    Nandi, Soumen
    Sen, Sagnik
    Supraja, D. K.
    COMBINATORIAL ALGORITHMS, IWOCA 2023, 2023, 13889 : 148 - 159
  • [34] Primal-target neural net heuristics for the hypergraph k-coloring problem
    Kaznachey, D
    Jagota, A
    Das, S
    1997 IEEE INTERNATIONAL CONFERENCE ON NEURAL NETWORKS, VOLS 1-4, 1997, : 1251 - 1255
  • [35] Metaheuristic for Optimal Dynamic K-Coloring Application on Band Sharing for Automotive Radars
    Roudiere, Sylvain
    Martinez, Vincent
    Marechal, Pierre
    Delahaye, Daniel
    SENSORS, 2023, 23 (12)
  • [36] A linear algorithm for radio k-coloring of powers of paths having small diameters
    Chakraborty, Dipayan
    Nandi, Soumen
    Sen, Sagnik
    Supraja, D. K.
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2025, 147
  • [37] An upper bound of radio k-coloring problem and its integer linear programming model
    Elsayed M. Badr
    Mahmoud I. Moussa
    Wireless Networks, 2020, 26 : 4955 - 4964
  • [38] Circuit Design for k-Coloring Problem and Its Implementation in Any Dimensional Quantum System
    Saha A.
    Saha D.
    Chakrabarti A.
    SN Computer Science, 2021, 2 (6)
  • [39] SMALLEST 3-GRAPHS HAVING A 3-COLORED EDGE IN EVERY K-COLORING
    STERBOUL, F
    DISCRETE MATHEMATICS, 1979, 27 (02) : 205 - 210
  • [40] Circuit Design for K-coloring Problem and its Implementation on Near-term Quantum Devices
    Saha, Amit
    Saha, Debasri
    Chakrabarti, Arnim
    2020 6TH IEEE INTERNATIONAL SYMPOSIUM ON SMART ELECTRONIC SYSTEMS (ISES 2020) (FORMERLY INIS), 2020, : 17 - 22
12345