点燃
发表于 2025-3-26 21:53:11
https://doi.org/10.1007/978-1-4842-6603-8irst-order formulae cannot have a global view of a structure. This limitation ensures their low sequential computational complexity. We show that the locality impacts as well on their distributed computational complexity. We use first-order formulae to describe the properties of finite connected gra
共同确定为确
发表于 2025-3-27 01:39:11
http://reply.papertrans.cn/39/3881/388016/388016_32.png
Creatinine-Test
发表于 2025-3-27 09:20:22
http://reply.papertrans.cn/39/3881/388016/388016_33.png
咒语
发表于 2025-3-27 11:25:29
http://reply.papertrans.cn/39/3881/388016/388016_34.png
OASIS
发表于 2025-3-27 17:07:37
http://reply.papertrans.cn/39/3881/388016/388016_35.png
基因组
发表于 2025-3-27 20:30:03
https://doi.org/10.1057/9780230625198duced prime graphs with respect to . and an undirected graph has rank-width at most 1 if and only if it is a distance-hereditary graph. We are interested in an extension of these results to directed graphs. We give several characterizations of directed graphs of rank-width 1 and we prove that the ra
pulmonary
发表于 2025-3-28 01:10:27
http://reply.papertrans.cn/39/3881/388016/388016_37.png
incite
发表于 2025-3-28 04:26:29
https://doi.org/10.1007/978-3-642-76401-1 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.
nettle
发表于 2025-3-28 09:15:47
Mathematics and Its Applications 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).
亚麻制品
发表于 2025-3-28 10:40:16
http://reply.papertrans.cn/39/3881/388016/388016_40.png