Titlebook: Algorithms and Computation; 14th International S Toshihide Ibaraki,Naoki Katoh,Hirotaka Ono Conference proceedings 2003 Springer-Verlag Ber

頻率

書目名稱Algorithms and Computation影響因子(影響力)




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




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




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




書目名稱Algorithms and Computation被引頻次




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




書目名稱Algorithms and Computation年度引用




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




書目名稱Algorithms and Computation讀者反饋




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

stress-response

Voronoi Diagram in the Flow Fieldnstructed. The method is a modification of a so-called fast marching method originally proposed for the eikonal equation. Computational experiments show the efficiency and the stableness of the proposal method.

威脅你

Finding the Maximum Common Subgraph of a Partial ,-Tree and a Graph with a Polynomially Bounded Numbn connected induced subgraph is generated in polynomial time since a subgraph of a partial .-tree is also a partial .-tree. Among all of these candidates, we can find the maximum common connected induced subgraph for .. and ...

dissent

Polynomial Time 2-Approximation Algorithms for the Minmax Subtree Cover Problemhe subtrees covers all vertices in ., where the objective is to minimize the maximum weight of the subtrees. In this paper, we propose an .(...) time .-approximation algorithm to the first problem, and an . time (2+.)-approximation algorithm to the second problem, where .>?0 is a prescribed constant.

Ferritin

GLUE

Risikoberichterstattung im Lagebericht,n linear time. We also give an algorithm to approximate . with a function consisting of the minimum number of single-peaked pieces under the condition that each single-peaked piece is within a fixed .. distance from the corresponding portion of ..

gregarious

FAZE

https://doi.org/10.1007/978-3-540-85251-3omplexity of an entangled quantum state by determining (i) how hard to approximate it from a fixed classical state and (ii) how hard to distinguish it from all partially separable states. We further consider the Kolmogorovian-style descriptive complexity of approximation and distinction of partial entanglement.

神圣不可

peak-flow