Titlebook: WALCOM: Algorithms and Computation; Second International Shin-ichi Nakano,Md. Saidur Rahman Conference proceedings 2008 Springer-Verlag Ber

古董

Vertex Domination in Dynamic Networksworks: 1) How can we transfer a given configuration to a dominating configuration while keeping that any intermediate configuration is safe? 2) How can we reduce the computational complexity of the vertex domination problem by allowing defections in the domination?

FELON

Vertex Domination in Dynamic Networksworks: 1) How can we transfer a given configuration to a dominating configuration while keeping that any intermediate configuration is safe? 2) How can we reduce the computational complexity of the vertex domination problem by allowing defections in the domination?

不給啤

憤慨點吧

Simple Geometrical Intersection Graphsince they have simple structures and many hard problems become easy on the graphs. In this paper, we survey known results and investigate (unit) grid intersection graphs, which is one of natural generalized interval graphs. We show that the graph class has so rich structure that some typical problems are still hard on the graph class.

擔(dān)憂

Indexing Circular Patterns positions .?∈?[1...] and wrapping around the end and if any of these patterns matches ., we find a match for .. In this paper, we present two efficient data structures to index circular patterns. This problem has applications in pattern matching in geometric and astronomical data as well as in computer graphics and bioinformatics.

Scintigraphy

鞭子

Guarding Exterior Region of a Simple Polygonn the convex hull. In other words, we try to identify the possible position of guard on the boundary of convex hull such that the maximum distance required to reach a trouble point on the boundary of polygon . avoiding the interior region of . is minimized. The time complexity of our algorithm is .(.) where . is the number of vertices of ..

傲慢人

性冷淡

TSH582