Titlebook: ;

conjunctiva

异端

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

Parameterized Complexity of Generalized Domination Problems, of size . (and at most .) are W[1]-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

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

阐明

永久

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

Blatant

乞丐

骗子