語系:
繁體中文
English
日文
簡体中文
說明(常見問題)
登入
回首頁
切換:
標籤
|
MARC模式
|
ISBD
Centrality metrics for complex netwo...
~
Meghanathan, Natarajan, (1977-)
Centrality metrics for complex network analysis[electronic resource] :emerging research and opportunities /
紀錄類型:
書目-電子資源 : Monograph/item
杜威分類號:
511/.5
書名/作者:
Centrality metrics for complex network analysis : emerging research and opportunities // by Natarajan Meghanathan.
作者:
Meghanathan, Natarajan,
出版者:
Hershey, Pennsylvania : : IGI Global,, [2018]
面頁冊數:
1 online resource (xv, 183 p.)
標題:
Telecommunication systems - Mathematical models.
標題:
System analysis - Graphic methods.
標題:
Centrality (Graph theory)
ISBN:
9781522538035 (ebook)
ISBN:
9781522538028 (hardcover)
書目註:
Includes bibliographical references and index.
內容註:
Chapter 1. Centrality metrics, measures, and real-world network graphs: Node and edge centrality metrics, correlation measures, and real-world network graphs -- Chapter 2. Computationally light vs. computationally heavy centrality metrics: correlation analysis between computationally light and computationally heavy centrality metrics -- Chapter 3. Centrality-based assortativity analysis of complex network graphs -- Chapter 4. Temporal variation of the node centrality metrics for scale-free networks -- Chapter 5. Edge centrality metrics to quantify the stability of links for mobile sensor networks -- Chapter 6. Use of eigenvector centrality for mobile target tracking -- Chapter 7. Use of centrality metrics for ranking of courses based on their relative contribution in a curriculum network graph.
摘要、提要註:
"This book explores node and edge centrality metrics and real-world network graphs, computationally-light vs. computationally-heavy centrality metrics, centrality-based connected dominating sets for complex network graphs, assortativity analysis based on centrality metrics, time-dependent variation of the node centrality metrics during the evolution of a scale-free network, curriculum network graph analysis, and eigenvector centrality-based approach to detect graph isomorphism"--
電子資源:
http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/978-1-5225-3802-8
Centrality metrics for complex network analysis[electronic resource] :emerging research and opportunities /
Meghanathan, Natarajan,1977-
Centrality metrics for complex network analysis
emerging research and opportunities /[electronic resource] :by Natarajan Meghanathan. - Hershey, Pennsylvania :IGI Global,[2018] - 1 online resource (xv, 183 p.)
Includes bibliographical references and index.
Chapter 1. Centrality metrics, measures, and real-world network graphs: Node and edge centrality metrics, correlation measures, and real-world network graphs -- Chapter 2. Computationally light vs. computationally heavy centrality metrics: correlation analysis between computationally light and computationally heavy centrality metrics -- Chapter 3. Centrality-based assortativity analysis of complex network graphs -- Chapter 4. Temporal variation of the node centrality metrics for scale-free networks -- Chapter 5. Edge centrality metrics to quantify the stability of links for mobile sensor networks -- Chapter 6. Use of eigenvector centrality for mobile target tracking -- Chapter 7. Use of centrality metrics for ranking of courses based on their relative contribution in a curriculum network graph.
Restricted to subscribers or individual electronic text purchasers.
"This book explores node and edge centrality metrics and real-world network graphs, computationally-light vs. computationally-heavy centrality metrics, centrality-based connected dominating sets for complex network graphs, assortativity analysis based on centrality metrics, time-dependent variation of the node centrality metrics during the evolution of a scale-free network, curriculum network graph analysis, and eigenvector centrality-based approach to detect graph isomorphism"--
ISBN: 9781522538035 (ebook)Subjects--Topical Terms:
587043
Telecommunication systems
--Mathematical models.
LC Class. No.: TK5102.83 / .M44 2018e
Dewey Class. No.: 511/.5
Centrality metrics for complex network analysis[electronic resource] :emerging research and opportunities /
LDR
:02310nmm a2200277 a 4500
001
512386
003
IGIG
005
20181029151508.0
006
m o d
007
cr cn
008
210927s2018 pau fob 001 0 eng d
010
$z
2017022538
020
$a
9781522538035 (ebook)
020
$a
9781522538028 (hardcover)
035
$a
(OCoLC)1032780381
035
$a
1071025174
040
$a
CaBNVSL
$b
eng
$c
CaBNVSL
$d
CaBNVSL
050
4
$a
TK5102.83
$b
.M44 2018e
082
0 4
$a
511/.5
$2
23
100
1
$a
Meghanathan, Natarajan,
$d
1977-
$3
564358
245
1 0
$a
Centrality metrics for complex network analysis
$h
[electronic resource] :
$b
emerging research and opportunities /
$c
by Natarajan Meghanathan.
260
$a
Hershey, Pennsylvania :
$b
IGI Global,
$c
[2018]
300
$a
1 online resource (xv, 183 p.)
504
$a
Includes bibliographical references and index.
505
0
$a
Chapter 1. Centrality metrics, measures, and real-world network graphs: Node and edge centrality metrics, correlation measures, and real-world network graphs -- Chapter 2. Computationally light vs. computationally heavy centrality metrics: correlation analysis between computationally light and computationally heavy centrality metrics -- Chapter 3. Centrality-based assortativity analysis of complex network graphs -- Chapter 4. Temporal variation of the node centrality metrics for scale-free networks -- Chapter 5. Edge centrality metrics to quantify the stability of links for mobile sensor networks -- Chapter 6. Use of eigenvector centrality for mobile target tracking -- Chapter 7. Use of centrality metrics for ranking of courses based on their relative contribution in a curriculum network graph.
506
$a
Restricted to subscribers or individual electronic text purchasers.
520
3
$a
"This book explores node and edge centrality metrics and real-world network graphs, computationally-light vs. computationally-heavy centrality metrics, centrality-based connected dominating sets for complex network graphs, assortativity analysis based on centrality metrics, time-dependent variation of the node centrality metrics during the evolution of a scale-free network, curriculum network graph analysis, and eigenvector centrality-based approach to detect graph isomorphism"--
$c
Provided by publisher.
650
0
$a
Telecommunication systems
$x
Mathematical models.
$3
587043
650
0
$a
System analysis
$x
Graphic methods.
$3
662753
650
0
$a
Centrality (Graph theory)
$3
732877
856
4 0
$u
http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/978-1-5225-3802-8
筆 0 讀者評論
多媒體
多媒體檔案
http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/978-1-5225-3802-8
評論
新增評論
分享你的心得
Export
取書館別
處理中
...
變更密碼
登入