Mri485
发表于 2025-4-1 02:47:59
http://reply.papertrans.cn/39/3881/388045/388045_61.png
无能的人
发表于 2025-4-1 07:01:31
Greedy triangulation can be efficiently implemented in the average case,Let . be a set of . points uniformly distributed in a unit square. We show that the greedy triangulation of . can be computed in .(.log..) expected time (without bucketing). The best previously known upper-bound on the expected-time performance of an algorithm for the greedy triangulation was .(..).
语言学
发表于 2025-4-1 11:17:23
http://reply.papertrans.cn/39/3881/388045/388045_63.png
myalgia
发表于 2025-4-1 15:14:18
Graph-Theoretic Concepts in Computer Science978-3-540-46076-3Series ISSN 0302-9743 Series E-ISSN 1611-3349
charisma
发表于 2025-4-1 21:18:56
https://doi.org/10.1007/978-3-319-53082-6t the property holds just in case the property (or a related property) holds for some specific subgraphs determined by the fibres of the derivation. On the one hand, this leads to proper tests of compatible properties. On the other hand, compatible properties turn out to be decidable for the corresponding graph languages, i.e., the questions