Titlebook: ;

表两个

helper-T-cells

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 ..

翻动

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.

不断的变动

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.

窒息

fastness

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

柏树

insurgent

得意牛