Titlebook: Combinatorial Algorithms; 22th International W Costas S. Iliopoulos,William F. Smyth Conference proceedings 2011 Springer-Verlag GmbH Berli

controllers

书目名称Combinatorial Algorithms影响因子(影响力)




书目名称Combinatorial Algorithms影响因子(影响力)学科排名




书目名称Combinatorial Algorithms网络公开度




书目名称Combinatorial Algorithms网络公开度学科排名




书目名称Combinatorial Algorithms被引频次




书目名称Combinatorial Algorithms被引频次学科排名




书目名称Combinatorial Algorithms年度引用




书目名称Combinatorial Algorithms年度引用学科排名




书目名称Combinatorial Algorithms读者反馈




书目名称Combinatorial Algorithms读者反馈学科排名

斑驳

Vulnerary

Parameterized Longest Previous Factor,g) is a sophisticated string composed of symbols from a constant alphabet Σ and a parameter alphabet Π. We generalize the LPF problem to the parameterized longest previous factor (pLPF) problem defined for p-strings. Subsequently, we present a linear time solution to construct the . array. Given our

造反,叛乱

心神不宁

广口瓶

The 1-Neighbour Knapsack Problem,can be selected only if at least one of its neighbours is also selected. We give approximation algorithms and hardness results when the nodes have both uniform and arbitrary weight and profit functions, and when the dependency graph is directed and undirected.

广口瓶

尊重

,Stable Sets of Threshold-Based Cascades on the Erdős-Rényi Random Graphs,a given . ∈ ( 0,1 ], a non-isolated vertex is activated (resp., deactivated) in round . ∈ ℤ. if the fraction . of its neighboring vertices that were active in round . − 1 satisfies . ≥ . (resp., . < .). An irreversible cascade is defined similarly except that active vertices cannot be deactivated. A

否决

Radiation