Titlebook: Combinatorics, Algorithms, Probabilistic and Experimental Methodologies; First International Bo Chen,Mike Paterson,Guochuan Zhang Conferen

counterfeit

書目名稱Combinatorics, Algorithms, Probabilistic and Experimental Methodologies影響因子(影響力)




書目名稱Combinatorics, Algorithms, Probabilistic and Experimental Methodologies影響因子(影響力)學(xué)科排名




書目名稱Combinatorics, Algorithms, Probabilistic and Experimental Methodologies網(wǎng)絡(luò)公開度




書目名稱Combinatorics, Algorithms, Probabilistic and Experimental Methodologies網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Combinatorics, Algorithms, Probabilistic and Experimental Methodologies被引頻次




書目名稱Combinatorics, Algorithms, Probabilistic and Experimental Methodologies被引頻次學(xué)科排名




書目名稱Combinatorics, Algorithms, Probabilistic and Experimental Methodologies年度引用




書目名稱Combinatorics, Algorithms, Probabilistic and Experimental Methodologies年度引用學(xué)科排名




書目名稱Combinatorics, Algorithms, Probabilistic and Experimental Methodologies讀者反饋




書目名稱Combinatorics, Algorithms, Probabilistic and Experimental Methodologies讀者反饋學(xué)科排名

Gentry

金盤是高原

主動(dòng)

ATRIA

alcohol-abuse

An Effective Refinement Algorithm Based on Swarm Intelligence for Graph Bipartitioning,t bipartitioning problem is a fundamental graph partitioning problem and is NP-Complete. In this paper, we present an effective multi-level refinement algorithm based on swarm intelligence for bisecting graph. The success of our algorithm relies on exploiting both the swarm intelligence theory with

alcohol-abuse

On the Complexity and Approximation of the Min-Sum and Min-Max Disjoint Paths Problems,ths to connect all the source-sink pairs with minimized total length, while the Min-Max Disjoint Paths problem asks also . disjoint paths to connect all source-sink pairs but with minimized length of the longest path. In this paper we show that the weighted Min-Sum Disjoint Paths problem is ..-compl

Minuet

A Digital Watermarking Scheme Based on Singular Value Decomposition,hemes which are based on SVD (Singular Value Decomposition) are being developed in some literatures [1, 15] nowadays. All of these SVD-based watermarking schemes have good embedding quality and high robustness, but they must depend on an original image or store some extra tables to extract watermark

原始

不滿分子

Clique-Transversal Sets in Cubic Graphs, the minimum cardinality of a clique-transversal set in .. In this paper we present an upper bound and a lower bound on ..(.) for cubic graphs, and characterize the extremal cubic graphs achieving the lower bound. In addition, we present a sharp upper bound on ..(.) for claw-free cubic graphs.