找回密碼
 To register

QQ登錄

只需一步,快速開始

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

打印 上一主題 下一主題

Titlebook: Network Analysis; Methodological Found Ulrik Brandes,Thomas Erlebach Textbook 2005 Springer-Verlag Berlin Heidelberg 2005 Computer.Graph th

[復(fù)制鏈接]
查看: 25113|回復(fù): 57
樓主
發(fā)表于 2025-3-21 18:36:57 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
書目名稱Network Analysis
副標(biāo)題Methodological Found
編輯Ulrik Brandes,Thomas Erlebach
視頻videohttp://file.papertrans.cn/663/662764/662764.mp4
概述Includes supplementary material:
叢書名稱Lecture Notes in Computer Science
圖書封面Titlebook: Network Analysis; Methodological Found Ulrik Brandes,Thomas Erlebach Textbook 2005 Springer-Verlag Berlin Heidelberg 2005 Computer.Graph th
描述.‘Network’ is a heavily overloaded term, so that ‘network analysis’ means different things to different people. Specific forms of network analysis are used in the study of diverse structures such as the Internet, interlocking directorates, transportation systems, epidemic spreading, metabolic pathways, the Web graph, electrical circuits, project plans, and so on. There is, however, a broad methodological foundation which is quickly becoming a prerequisite for researchers and practitioners working with network models...From a computer science perspective, network analysis is applied graph theory. Unlike standard graph theory books, the content of this book is organized according to methods for specific levels of analysis (element, group, network) rather than abstract concepts like paths, matchings, or spanning subgraphs. Its topics therefore range from vertex centrality to graph clustering and the evolution of scale-free networks...In 15 coherent chapters, this monograph-like tutorial book introduces and surveys the concepts and methods that drive network analysis, and is thus the first book to do so from a methodological perspective independent of specific application areas...
出版日期Textbook 2005
關(guān)鍵詞Computer; Graph theory; Internet; algorithms; applied graph theory; combinatorial optimization; connectivi
版次1
doihttps://doi.org/10.1007/b106453
isbn_softcover978-3-540-24979-5
isbn_ebook978-3-540-31955-9Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag Berlin Heidelberg 2005
The information of publication is updating

書目名稱Network Analysis影響因子(影響力)




書目名稱Network Analysis影響因子(影響力)學(xué)科排名




書目名稱Network Analysis網(wǎng)絡(luò)公開度




書目名稱Network Analysis網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Network Analysis被引頻次




書目名稱Network Analysis被引頻次學(xué)科排名




書目名稱Network Analysis年度引用




書目名稱Network Analysis年度引用學(xué)科排名




書目名稱Network Analysis讀者反饋




書目名稱Network Analysis讀者反饋學(xué)科排名




單選投票, 共有 1 人參與投票
 

0票 0.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

1票 100.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用戶組沒有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 22:10:38 | 只看該作者
板凳
發(fā)表于 2025-3-22 00:29:52 | 只看該作者
Textbook 2005 used in the study of diverse structures such as the Internet, interlocking directorates, transportation systems, epidemic spreading, metabolic pathways, the Web graph, electrical circuits, project plans, and so on. There is, however, a broad methodological foundation which is quickly becoming a pre
地板
發(fā)表于 2025-3-22 06:29:19 | 只看該作者
5#
發(fā)表于 2025-3-22 11:39:44 | 只看該作者
6#
發(fā)表于 2025-3-22 16:26:41 | 只看該作者
7#
發(fā)表于 2025-3-22 17:25:44 | 只看該作者
0302-9743 roduces and surveys the concepts and methods that drive network analysis, and is thus the first book to do so from a methodological perspective independent of specific application areas...978-3-540-24979-5978-3-540-31955-9Series ISSN 0302-9743 Series E-ISSN 1611-3349
8#
發(fā)表于 2025-3-23 00:30:11 | 只看該作者
Andreas Baltz,Lasse Kliemanne mathematical level of the book su?ciently low and often rely on heuristic arguments to stress the underlying ideas of the concepts introduced rather than insist on technical details. Ma- ematically oriented r978-1-4419-2607-4978-0-387-75839-8Series ISSN 0172-7397 Series E-ISSN 2197-568X
9#
發(fā)表于 2025-3-23 02:27:54 | 只看該作者
10#
發(fā)表于 2025-3-23 08:23:51 | 只看該作者
Introductioneems adequate to treat network analysis as a field of its own. From a computer science point of view, it might well be subsumed under ‘a(chǎn)pplied graph theory,’ since structural and algorithmic aspects of abstract graphs are the prevalent methodological determinants in many applications, no matter whic
 關(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-13 01:26
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
雅江县| 合作市| 唐海县| 张家界市| 山西省| 麻栗坡县| 三江| 台州市| 马关县| 正宁县| 武清区| 资溪县| 桐城市| 阿图什市| 泾源县| 耒阳市| 姚安县| 南雄市| 新巴尔虎左旗| 曲水县| 濮阳市| 林西县| 彭水| 南昌市| 景东| 庐江县| 新绛县| 乌兰县| 浦江县| 施秉县| 彩票| 鹤峰县| 镇雄县| 松阳县| 庆城县| 拉孜县| 托克逊县| 依安县| 建阳市| 兴义市| 三门峡市|