Titlebook: Combinatorial Algorithms; 24th International W Thierry Lecroq,Laurent Mouchard Conference proceedings 2013 Springer-Verlag Berlin Heidelber

CRUST

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




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




书目名称Combinatorial Algorithms网络公开度




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




书目名称Combinatorial Algorithms被引频次




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




书目名称Combinatorial Algorithms年度引用




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




书目名称Combinatorial Algorithms读者反馈




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

Glucocorticoids

On Maximum Rank Aggregation Problemse expressed by permutations, whose distance can be measured in many ways..In this work we study a collection of distances, including the Kendall tau, Spearman footrule, Spearman rho, Cayley, Hamming, Ulam, and Minkowski distances, and compute the consensus against the maximum, which attempts to mini

moribund

Deciding Representability of Sets of Words of Equal Length in Polynomial Timee words. Recently, the computational problem of representing subsets of .. by ., which are sequences that may have holes that match each letter of ., was considered and shown to be in .. However, membership in . remained open. In this paper, we show that deciding if a subset is representable can be

Crepitus

Prefix Table Construction and ConversionIn this paper we describe and evaluate algorithms for prefix table construction, some previously proposed, others designed by us. We also describe and evaluate new linear-time algorithms for transformations between . and the ..

漂白

On the Approximability of Splitting-SAT in 2-CNF Horn Formulas, we ask for a minimum-size set of variables to be split in order to make the formula satisfiable. This problem is known to be APX-hard, even for 2-CNF formulas. We consider the case of 2-CNF Horn formulas, i.e., 2-CNF formulas without positive 2-clauses, and prove that this problem is APX-hard as w

借喻

Boundary-to-Boundary Flows in Planar Graphshm uses only .(.) queries to simple data structures, achieving an .(. log.) running time that we expect to be practical given the use of simple primitives. The only existing algorithm for this problem uses divide and conquer and, in order to achieve an .(. log.) running time, requires the use of the

借喻

Exact Algorithms for Weak Roman Domination .: . → {0,1,2} such that every vertex . ∈ . is . (. there exists a neighbor . of ., possibly . = ., such that .) and for every vertex . ∈ . with .(.) = 0 there exists a neighbor . of . such that . and the function .. defined by:. does not contain any undefended vertex. The . of a wrd-function . is

assent

GET

Host142