| 書(shū)目名稱 | Network Analysis | | 副標(biāo)題 | Methodological Found | | 編輯 | Ulrik Brandes,Thomas Erlebach | | 視頻video | http://file.papertrans.cn/663/662764/662764.mp4 | | 概述 | Includes supplementary material: | | 叢書(shū)名稱 | Lecture Notes in Computer Science | | 圖書(shū)封面 |  | | 描述 | .‘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 | | doi | https://doi.org/10.1007/b106453 | | isbn_softcover | 978-3-540-24979-5 | | isbn_ebook | 978-3-540-31955-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 | | issn_series | 0302-9743 | | copyright | Springer-Verlag Berlin Heidelberg 2005 |
The information of publication is updating
|
|
|Archiver|手機(jī)版|小黑屋|
派博傳思國(guó)際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-13 01:19
發(fā)表于 2025-3-21 18:36:57
