表两个
发表于 2025-3-30 09:09:35
http://reply.papertrans.cn/39/3881/388027/388027_51.png
helper-T-cells
发表于 2025-3-30 13:35:43
https://doi.org/10.1007/978-3-322-85971-6A new parallel algorithm for the triangulation of a nonconvex polytope . is presented. It will be shown that . can be decomposed into O(n+r.) tetrahedra within time O(log(.) · (max{log*(.),log(.)}) with O(n+r.) processors, where . denotes the number of reflex edges of ..
翻动
发表于 2025-3-30 19:56:16
https://doi.org/10.1007/978-3-322-96867-8A set of operations on 4-connected graphs is introduced in which only line addition and vertex splitting are involved. It is shown that every 4-connected graph can be assembled from either the complete graph .. or the double-axle wheel .. on four vertices using only these operations, with 4-connectivity preserved.
不断的变动
发表于 2025-3-30 22:11:34
https://doi.org/10.1007/978-3-662-04882-5A conjecture about digraphs is presented. The conjecture has relevance to parallel computing, and is supported by a few concrete results.
窒息
发表于 2025-3-31 02:38:39
http://reply.papertrans.cn/39/3881/388027/388027_55.png
fastness
发表于 2025-3-31 06:08:04
Parallel triangulation of nonconvex polytopes,A new parallel algorithm for the triangulation of a nonconvex polytope . is presented. It will be shown that . can be decomposed into O(n+r.) tetrahedra within time O(log(.) · (max{log*(.),log(.)}) with O(n+r.) processors, where . denotes the number of reflex edges of ..
uncertain
发表于 2025-3-31 13:12:48
http://reply.papertrans.cn/39/3881/388027/388027_57.png
柏树
发表于 2025-3-31 15:33:26
http://reply.papertrans.cn/39/3881/388027/388027_58.png
insurgent
发表于 2025-3-31 18:48:23
http://reply.papertrans.cn/39/3881/388027/388027_59.png
得意牛
发表于 2025-4-1 00:21:35
http://reply.papertrans.cn/39/3881/388027/388027_60.png