勾引
发表于 2025-4-2 20:24:17
Line Transversals and Pinning NumbersA . to a family of convex objects in ℝ. is a line intersecting each member of the family. There is a rich theory of geometric transversals, see for instance the surveys of Danzer et al. , Eckhoff , Goodman et al. and Wenger .
背信
发表于 2025-4-3 02:49:40
http://reply.papertrans.cn/103/10201/1020034/1020034_72.png
有说服力
发表于 2025-4-3 06:17:38
Efficient Enumeration of Ordered Trees with , Leaves (Extended Abstract)In this paper, we give a simple algorithm to generate all ordered trees with exactly . vertices including exactly . leaves. The best known algorithm generates such trees in .(. − .) time for each, while our algorithm generates such trees in .(1) time for each in worst case.
coddle
发表于 2025-4-3 08:24:05
Efficient Enumeration of Ordered Trees with , Leaves (Extended Abstract)In this paper, we give a simple algorithm to generate all ordered trees with exactly . vertices including exactly . leaves. The best known algorithm generates such trees in .(. − .) time for each, while our algorithm generates such trees in .(1) time for each in worst case.
冰河期
发表于 2025-4-3 13:42:56
A Fully Dynamic Graph Algorithm for Recognizing Proper Interval GraphsWe present a fully dynamic graph algorithm to recognize proper interval graphs that runs in .(log.) worst case time per edge update, where . is the number of vertices in the graph. The algorithm also maintains the connected components and supports connectivity queries in .(log.) time.