conjunctiva
发表于 2025-3-28 17:32:16
http://reply.papertrans.cn/39/3881/388016/388016_41.png
异端
发表于 2025-3-28 21:11:08
Exact and Parameterized Algorithms for ,, with respect to the number of vertices. We also show that its running time is 2.1364... when the goal is to find a spanning tree with at least . internal vertices. Both running time bounds are obtained via a Measure & Conquer analysis, the latter one being a novel use of this kind of analysis for parameterized algorithms.
Charlatan
发表于 2025-3-28 23:54:57
Parameterized Complexity of Generalized Domination Problems, of size . (and at most .) are W-complete problems (when parameterized by .) for any pair of finite sets . and .. We further present results on dual parametrization by . − ., and results on certain infinite sets (in particular for ., . being the sets of even and odd integers).
characteristic
发表于 2025-3-29 04:12:43
An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning Trees,ath-maxima problem implies a linear-time algorithm for the . problem of determining whether a given spanning tree of a given undirected graph . with real edge weights is a minimum-weight spanning tree of ..
阐明
发表于 2025-3-29 09:23:24
http://reply.papertrans.cn/39/3881/388016/388016_45.png
永久
发表于 2025-3-29 12:28:47
https://doi.org/10.1007/978-1-4842-6603-8 and planar networks, first-order properties can be frugally evaluated, that is, with only a bounded number of messages, of size logarithmic in the number of nodes, sent over each link. Moreover, we show that the result carries over for the extension of first-order logic with unary counting.
Pigeon
发表于 2025-3-29 15:32:52
http://reply.papertrans.cn/39/3881/388016/388016_47.png
Blatant
发表于 2025-3-29 21:38:03
http://reply.papertrans.cn/39/3881/388016/388016_48.png
乞丐
发表于 2025-3-30 00:07:21
http://reply.papertrans.cn/39/3881/388016/388016_49.png
骗子
发表于 2025-3-30 07:09:13
http://reply.papertrans.cn/39/3881/388016/388016_50.png