设为首页收藏本站
开启辅助访问 切换到窄版

 找回密码
 To register

QQ登录

只需一步，快速开始

扫一扫，访问微社区

  • ALL
  • Journals
  • Books

派博传思国际中心 »期刊书目

› BOOKS
› BOOKS with Alphabet D (Da, Db,Dc, Dd, De…... )

123456下一页
返回列表

Titlebook: Distributed Graph Algorithms for Computer Networks; K. Erciyes Textbook 2013 Springer-Verlag London 2013 Ad Hoc Networks.Distributed Algor

[复制链接]
查看: 15465|回复: 57
发表于 2025-3-21 19:47:17 | 显示全部楼层 |阅读模式
书目名称Distributed Graph Algorithms for Computer Networks
编辑K. Erciyes
视频videohttp://file.papertrans.cn/282/281898/281898.mp4
概述Presents a comprehensive review of key distributed graph algorithms for computer network applications.Describes in detail the implementation of each algorithm, and discusses their concrete network app
丛书名称Computer Communications and Networks
图书封面Titlebook: Distributed Graph Algorithms for Computer Networks; K. Erciyes Textbook 2013 Springer-Verlag London 2013 Ad Hoc Networks.Distributed Algor
描述This book presents a comprehensive review of key distributed graph algorithms for computer network applications, with a particular emphasis on practical implementation. Topics and features: introduces a range of fundamental graph algorithms, covering spanning trees, graph traversal algorithms, routing algorithms, and self-stabilization; reviews graph-theoretical distributed approximation algorithms with applications in ad hoc wireless networks; describes in detail the implementation of each algorithm, with extensive use of supporting examples, and discusses their concrete network applications; examines key graph-theoretical algorithm concepts, such as dominating sets, and parameters for mobility and energy levels of nodes in wireless ad hoc networks, and provides a contemporary survey of each topic; presents a simple simulator, developed to run distributed algorithms; provides practical exercises at the end of each chapter.
出版日期Textbook 2013
关键词Ad Hoc Networks; Distributed Algorithm; Graph Algorithm; Network Algorithm; Sensor Networks; algorithm an
版次1
doihttps://doi.org/10.1007/978-1-4471-5173-9
isbn_softcover978-1-4471-5850-9
isbn_ebook978-1-4471-5173-9Series ISSN 1617-7975 Series E-ISSN 2197-8433
issn_series 1617-7975
copyrightSpringer-Verlag London 2013
The information of publication is updating

书目名称Distributed Graph Algorithms for Computer Networks影响因子(影响力)




书目名称Distributed Graph Algorithms for Computer Networks影响因子(影响力)学科排名




书目名称Distributed Graph Algorithms for Computer Networks网络公开度




书目名称Distributed Graph Algorithms for Computer Networks网络公开度学科排名




书目名称Distributed Graph Algorithms for Computer Networks被引频次




书目名称Distributed Graph Algorithms for Computer Networks被引频次学科排名




书目名称Distributed Graph Algorithms for Computer Networks年度引用




书目名称Distributed Graph Algorithms for Computer Networks年度引用学科排名




书目名称Distributed Graph Algorithms for Computer Networks读者反馈




书目名称Distributed Graph Algorithms for Computer Networks读者反馈学科排名




单选投票, 共有 0 人参与投票
1.jpg
 

0票 0%

Perfect with Aesthetics
2.jpg
 

0票 0%

Better Implies Difficulty
3.jpg
 

0票 0%

Good and Satisfactory
4.jpg
 

0票 0%

Adverse Performance
5.jpg
 

0票 0%

Disdainful Garbage
您所在的用户组没有投票权限
ED431
回复

举报

发表于 2025-3-22 00:13:03 | 显示全部楼层
Vertex Coloring has many applications such as task scheduling, register allocation, and channel frequency assignment. In this chapter, we investigate distributed vertex coloring algorithms for arbitrary graphs and trees.
远地点
回复

举报

发表于 2025-3-22 00:32:58 | 显示全部楼层
Maximal Independent Setsnt set of a graph has many important applications such as clustering in wireless networks, and independent sets can also be used to build other graph structures. In this chapter, we describe rank-based, randomized, and self-stabilizing distributed algorithms to form maximal independent sets of graphs.
光亮
回复

举报

发表于 2025-3-22 05:20:43 | 显示全部楼层
Vertex Coverhas many important applications such as facility location and monitoring link failures and placement of routers or agents in a computer network so that every node can be attached to a router or an agent. In this chapter, we will describe sequential and basic distributed algorithms for vertex covering.
光亮
回复

举报

发表于 2025-3-22 09:21:53 | 显示全部楼层
FLAIL
回复

举报

发表于 2025-3-22 16:04:29 | 显示全部楼层
Distributed Graph Algorithms for Computer Networks978-1-4471-5173-9Series ISSN 1617-7975 Series E-ISSN 2197-8433
招人嫉妒
回复

举报

发表于 2025-3-22 17:42:10 | 显示全部楼层
招人嫉妒
回复

举报

发表于 2025-3-22 23:55:31 | 显示全部楼层
https://doi.org/10.1057/9780230253100 has many applications such as task scheduling, register allocation, and channel frequency assignment. In this chapter, we investigate distributed vertex coloring algorithms for arbitrary graphs and trees.
pancreas
回复

举报

发表于 2025-3-23 04:56:42 | 显示全部楼层
https://doi.org/10.1057/9780230253100nt set of a graph has many important applications such as clustering in wireless networks, and independent sets can also be used to build other graph structures. In this chapter, we describe rank-based, randomized, and self-stabilizing distributed algorithms to form maximal independent sets of graphs.
Iatrogenic
回复

举报

发表于 2025-3-23 07:05:59 | 显示全部楼层
殖民地
回复

举报

下一页 »
123456下一页
返回列表
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 吾爱论文网 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
QQ|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-11-10 15:43
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表