有杂色
发表于 2025-3-23 13:31:09
http://reply.papertrans.cn/103/10201/1020037/1020037_11.png
headlong
发表于 2025-3-23 17:54:17
http://reply.papertrans.cn/103/10201/1020037/1020037_12.png
Mhc-Molecule
发表于 2025-3-23 19:13:21
http://reply.papertrans.cn/103/10201/1020037/1020037_13.png
吞噬
发表于 2025-3-23 23:11:12
Harmonious Coloring on Subclasses of Colinear Graphsar graphs. Moreover, we provide a polynomial solution for the harmonious coloring problem for the class of split strongly chordal graphs, the interest of which lies on the fact that the problem has been proved to be NP-complete on both split and strongly chordal graphs.
FEIGN
发表于 2025-3-24 04:59:39
Crossings between Curves with Many Tangenciesove every curve in . and that there are . pairs of curves, one from . and the other from ., that are tangent to each other. Then the number of proper crossings among the members of . is at least (1/2 − .(1)). ln .. This bound is almost tight.
grieve
发表于 2025-3-24 08:04:05
Constant-Work-Space Algorithm for a Shortest Path in a Simple Polygonalled “computing instead of storing”, we can design a naive quadratic-time algorithm for the problem using only constant work space, i.e., .(log.) bits in total for the work space, where . is the number of nodes in the tree. Then, another technique “controlled recursion” improves the time bound to .
东西
发表于 2025-3-24 13:03:59
http://reply.papertrans.cn/103/10201/1020037/1020037_17.png
CRANK
发表于 2025-3-24 17:51:36
http://reply.papertrans.cn/103/10201/1020037/1020037_18.png
债务
发表于 2025-3-24 20:24:17
http://reply.papertrans.cn/103/10201/1020037/1020037_19.png
口音在加重
发表于 2025-3-25 01:59:26
http://reply.papertrans.cn/103/10201/1020037/1020037_20.png