follicular-unit
发表于 2025-3-28 14:47:02
http://reply.papertrans.cn/39/3882/388183/388183_41.png
recede
发表于 2025-3-28 21:38:29
https://doi.org/10.1007/978-3-663-07310-9d by straightline segments a simple algorithm was given recently which is optimal (up to constants). For the case of regions bounded by more or less arbitrary curves no optimal algorithm is known to date. We present a simple (non-optimal) algorithm and demonstrate that space-optimal solutions are possible.
dendrites
发表于 2025-3-29 02:53:56
Hans-Ernst Schwiete,Reinhard Vinkeloes of the language constructs as well as in the efficiency of implementation. Then, we combine these concepts to new language constructs and propose an efficient implementation using associative array processors.
obsolete
发表于 2025-3-29 05:06:32
http://reply.papertrans.cn/39/3882/388183/388183_44.png
支柱
发表于 2025-3-29 09:05:17
http://reply.papertrans.cn/39/3882/388183/388183_45.png
sulcus
发表于 2025-3-29 14:11:38
http://reply.papertrans.cn/39/3882/388183/388183_46.png
小平面
发表于 2025-3-29 19:32:38
http://reply.papertrans.cn/39/3882/388183/388183_47.png
不容置疑
发表于 2025-3-29 21:28:08
http://reply.papertrans.cn/39/3882/388183/388183_48.png
colloquial
发表于 2025-3-30 00:02:46
http://reply.papertrans.cn/39/3882/388183/388183_49.png
nonplus
发表于 2025-3-30 06:08:49
https://doi.org/10.1007/978-3-642-52491-2This paper deals with some almost sure graph properties. A very efficient algorithm is given which yields a sample graph from the uniform distribution on the set of all connected graphs of given size n. An almost surely canonical graph labelling and an algorithm which tries to find a Hamiltonian cycle in a given graph are discussed.