毕业典礼
发表于 2025-3-23 11:09:58
https://doi.org/10.1007/978-1-349-21161-6r . together with a set . of words of length . over the four symbols .. The problem is to decide whether there exists a word of length . that contains every word in S at least once as a subword, and does not contain any other subword of length .. The computational complexity of this problem has been
deactivate
发表于 2025-3-23 17:44:37
http://reply.papertrans.cn/39/3881/388017/388017_12.png
choroid
发表于 2025-3-23 19:33:11
http://reply.papertrans.cn/39/3881/388017/388017_13.png
Blood-Vessels
发表于 2025-3-23 22:33:39
https://doi.org/10.1007/978-3-030-54352-5binatorics, the algorithmics, and the complexity of subcolorings..On the negative side, we prove that 2-subcoloring is NP-hard for comparability graphs, and that 3-subcoloring is NP-hard for AT-free graphs and for complements of planar graphs. On the positive side, we derive polynomial time algorith
抗体
发表于 2025-3-24 04:47:35
http://reply.papertrans.cn/39/3881/388017/388017_15.png
避开
发表于 2025-3-24 10:18:10
http://reply.papertrans.cn/39/3881/388017/388017_16.png
Osteoporosis
发表于 2025-3-24 12:18:11
http://reply.papertrans.cn/39/3881/388017/388017_17.png
认识
发表于 2025-3-24 18:24:13
https://doi.org/10.1007/978-3-030-76267-4 of a stable set . of . is .(.) = max.(υ) : υ ∈ . ∩ .. A .-coloring . = (. ., . . . , . .) of . is a partition of . into . stable sets . ., . . . , . . and the weight of . is .(. .) + . . . + .(. .). The objective then is to find a coloring . = (. ., . . . , . .) of . such that .(. .) + . . . + .(.
口诀
发表于 2025-3-24 22:16:05
http://reply.papertrans.cn/39/3881/388017/388017_19.png
negligence
发表于 2025-3-25 01:43:47
https://doi.org/10.1007/978-3-030-37417-4imum clique size ., a routing scheme using routing tables of .(. log .) bits per node and .(log .) bit addresses such that the length of the route between any two nodes is at most the distance between the nodes in the graph plus two. This is complemented by a recent lower bound that shows that if th