Titlebook: Computing and Combinatorics; 16th Annual Internat My T. Thai,Sartaj Sahni Conference proceedings 2010 Springer-Verlag Berlin Heidelberg 201

閘門

書目名稱Computing and Combinatorics影響因子(影響力)




書目名稱Computing and Combinatorics影響因子(影響力)學(xué)科排名




書目名稱Computing and Combinatorics網(wǎng)絡(luò)公開度




書目名稱Computing and Combinatorics網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Computing and Combinatorics被引頻次




書目名稱Computing and Combinatorics被引頻次學(xué)科排名




書目名稱Computing and Combinatorics年度引用




書目名稱Computing and Combinatorics年度引用學(xué)科排名




書目名稱Computing and Combinatorics讀者反饋




書目名稱Computing and Combinatorics讀者反饋學(xué)科排名

famine

上釉彩

Boxicity and Poset Dimension,..]×[..,..]×???×[..,..]. The . of ., box(.) is the minimum integer . such that . can be represented as the intersection graph of .-dimensional boxes, i.e. each vertex is mapped to a .-dimensional box and two vertices are adjacent in . if and only if their corresponding boxes intersect. Let . be a p

連詞

On the Hardness against Constant-Depth Linear-Size Circuitsation, as there are general derandomization results which are based on the assumption that average-case hard functions exist. However, to achieve a complete derandomization, one usually needs a function which is extremely hard against a complexity class, in the sense that any algorithm in the class

jovial

繞著哥哥問

The Curse of Connectivity: ,-Total Vertex (Edge) Coverly .-. and .-.. Specifically, we impose the additional requirement that each connected component of a solution have at least . vertices (resp. edges from the solution), and call the problem .-. (resp. .-.). We show that

繞著哥哥問

強(qiáng)制令

結(jié)構(gòu)

咯咯笑

Clustering with or without the Approximationollow-up papers. The input for the clustering problem consists of points in a metric space and a number ., specifying the desired number of clusters. The algorithms find a clustering that is provably close to a target clustering, provided that the instance has the “( 1?+?., .)-property”, which means