Zobrazeno 1 - 10
of 1 562
pro vyhledávání: '"Chan, Siu On"'
We consider the pebble game on DAGs with bounded fan-in introduced in [Paterson and Hewitt '70] and the reversible version of this game in [Bennett '89], and study the question of how hard it is to decide exactly or approximately the number of pebble
Externí odkaz:
http://arxiv.org/abs/2305.19104
Autor:
Chan, Siu-Ming1 siuming.chan@cityu.edu.hk, Xu, Heng1, Tang, Yuen-Ki1, Zhang, Jasmine1, Kwok, Kim1, Lam, Bess Yin-Hung2, Tang, Wing-Him3, Lui, Ka-Chun4
Publikováno v:
International Journal for Equity in Health. 11/29/2024, Vol. 23 Issue 1, p1-11. 11p.
Graph coloring, a classical and critical NP-hard problem, is the problem of assigning connected nodes as different colors as possible. However, we observe that state-of-the-art GNNs are less successful in the graph coloring problem. We analyze the re
Externí odkaz:
http://arxiv.org/abs/2208.06975
Publikováno v:
In Engineering Structures 15 November 2024 319
Publikováno v:
In Engineering Structures 1 October 2024 316
Publikováno v:
In Journal of Constructional Steel Research January 2025 224 Part A
Publikováno v:
In Journal of Constructional Steel Research January 2025 224 Part A
Autor:
Fung, John Tai Chun, Chan, Siu Ling, Chan, Chun Kit, Lam, Choi Fung, Chau, Yuk Shuen, Lam, Wing Hang, Cheng, Christopher Chi Wai, Lai, Man Hin
Publikováno v:
In Nurse Education Today September 2024 140
Publikováno v:
In Journal of Constructional Steel Research July 2024 218
Publikováno v:
In Engineering Structures 15 February 2024 301