找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

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

[復(fù)制鏈接]
樓主: 乳缽
51#
發(fā)表于 2025-3-30 10:50:10 | 只看該作者
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?
52#
發(fā)表于 2025-3-30 12:27:43 | 只看該作者
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?
53#
發(fā)表于 2025-3-30 18:46:11 | 只看該作者
54#
發(fā)表于 2025-3-30 22:52:39 | 只看該作者
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.
55#
發(fā)表于 2025-3-31 02:54:41 | 只看該作者
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.
56#
發(fā)表于 2025-3-31 07:18:41 | 只看該作者
57#
發(fā)表于 2025-3-31 09:22:26 | 只看該作者
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 ..
58#
發(fā)表于 2025-3-31 14:24:13 | 只看該作者
59#
發(fā)表于 2025-3-31 19:01:20 | 只看該作者
60#
發(fā)表于 2025-3-31 23:58:46 | 只看該作者
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-8 02:46
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
炉霍县| 昌吉市| 丰原市| 汪清县| 凤山县| 山西省| 富源县| 泾川县| 昌黎县| 车致| 陵水| 洞头县| 铁力市| 霍山县| 舞钢市| 新干县| 延吉市| 东乡县| 河源市| 全州县| 手游| 固阳县| 洛南县| 阿鲁科尔沁旗| 曲松县| 轮台县| 和政县| 南昌县| 双流县| 大荔县| 丹棱县| 滨州市| 芮城县| 杭州市| 太白县| 威海市| 石台县| 开平市| 二手房| 井研县| 乳源|