Titlebook: ;

畢業(yè)典禮

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

choroid

Blood-Vessels

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

抗體

避開

Osteoporosis

認(rèn)識

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 .(. .) + . . . + .(.

口訣

negligence

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