找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

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

[复制链接]
楼主: miserly
发表于 2025-3-23 10:45:44 | 显示全部楼层
发表于 2025-3-23 16:24:11 | 显示全部楼层
发表于 2025-3-23 19:14:37 | 显示全部楼层
发表于 2025-3-24 01:44:52 | 显示全部楼层
发表于 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.
发表于 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.
发表于 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
发表于 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 ..
发表于 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
发表于 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
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 吾爱论文网 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
QQ|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-8-14 13:10
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表