找回密碼
 To register

QQ登錄

只需一步,快速開始

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

打印 上一主題 下一主題

Titlebook: Connected Dominating Set: Theory and Applications; Ding-Zhu Du,Peng-Jun Wan Textbook 2013 Springer Science+Business Media New York 2013 ap

[復(fù)制鏈接]
樓主: miserly
11#
發(fā)表于 2025-3-23 10:45:44 | 只看該作者
12#
發(fā)表于 2025-3-23 16:24:11 | 只看該作者
13#
發(fā)表于 2025-3-23 19:14:37 | 只看該作者
14#
發(fā)表于 2025-3-24 01:44:52 | 只看該作者
15#
發(fā)表于 2025-3-24 04:12:48 | 只看該作者
CDS in Unit Ball Graphs and Growth Bounded Graphs,s sensor network, which has a mathematical model, the unit ball graph. A unit ball graph consists of vertices lying in the three-dimensional Euclidean space. There exists an edge between two vertices . and . if and only if the distance between them, .(., .) is at most one.
16#
發(fā)表于 2025-3-24 10:12:29 | 只看該作者
Routing-Cost Constrained CDS,nd through . is 1-4-5-6-2, which is significantly longer than 1-2-3. This example indicates a problem about CDS that while CDS is introduced to save resources in wireless networks, routing cost and communication delay may be increased.
17#
發(fā)表于 2025-3-24 14:30:23 | 只看該作者
CDS in Disk-Containment Graphs, radius .. centered at .. The disk-containment graph (DCG) of . is the undirected graph . in which . ∈ . if and only if the disk-associated . contains . and disk-associated . contains .. In other words, . ∈ . if and only if the Euclidean distance between . and . is no more than .. When all the disks
18#
發(fā)表于 2025-3-24 17:00:52 | 只看該作者
CDS in Disk-Intersection Graphs,aph on . in which . and . are adjacent if and only if the disk centered at . of radius . and the disk centered at . of radius . intersect, or equivalently, . If . for all . ∈ ., then . is exactly the unit disk graph (UDG) of ..
19#
發(fā)表于 2025-3-24 19:45:21 | 只看該作者
Geometric Hitting Set and Disk Cover, by sensing disks. When all sensing disks have the same size, a classic result indicates that . has PTAS. In this chapter, we introduce some related results in case that sensing disks may have different sizes. Those results may lead us to a sequence of research works on coverage and connected covera
20#
發(fā)表于 2025-3-24 23:46:42 | 只看該作者
Minimum-Latency Scheduling,he unit disk graph (UDG) of .. Under the protocol interference model, every node has a communication radius normalized to one, and an interference radius ρ for some parameter ρ ≥ 1 (see Fig. 11.1). A node . can receive the message successfully from a transmitting node . if . is within the transmissi
 關(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 09:59
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
宜都市| 襄城县| 海伦市| 武冈市| 贵港市| 石楼县| 镶黄旗| 民县| 顺义区| 酒泉市| 沾益县| 临海市| 深水埗区| 铜梁县| 前郭尔| 瑞安市| 綦江县| 本溪市| 鲁甸县| 屏东县| 吴江市| 龙门县| 和田市| 久治县| 西盟| 庄河市| 沙河市| 怀来县| 正镶白旗| 芮城县| 松原市| 长兴县| 双鸭山市| 扶沟县| 新化县| 贵阳市| 普洱| 香港| 垣曲县| 定陶县| 商城县|