|
|
|
|
| LEADER |
03518nam a22005895i 4500 |
| 001 |
978-3-540-31955-9 |
| 003 |
DE-He213 |
| 005 |
20151204161427.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100924s2005 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783540319559
|9 978-3-540-31955-9
|
| 024 |
7 |
|
|a 10.1007/b106453
|2 doi
|
| 040 |
|
|
|d GrThAP
|
| 050 |
|
4 |
|a QA76.9.M35
|
| 072 |
|
7 |
|a PBD
|2 bicssc
|
| 072 |
|
7 |
|a UYAM
|2 bicssc
|
| 072 |
|
7 |
|a COM018000
|2 bisacsh
|
| 072 |
|
7 |
|a MAT008000
|2 bisacsh
|
| 082 |
0 |
4 |
|a 004.0151
|2 23
|
| 245 |
1 |
0 |
|a Network Analysis
|h [electronic resource] :
|b Methodological Foundations /
|c edited by Ulrik Brandes, Thomas Erlebach.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg,
|c 2005.
|
| 300 |
|
|
|a XII, 472 p.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 3418
|
| 505 |
0 |
|
|a Fundamentals -- I Elements -- Centrality Indices -- Algorithms for Centrality Indices -- Advanced Centrality Concepts -- II Groups -- Local Density -- Connectivity -- Clustering -- Role Assignments -- Blockmodels -- Network Statistics -- Network Comparison -- Network Models -- Spectral Analysis -- Robustness and Resilience.
|
| 520 |
|
|
|a ‘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.
|
| 650 |
|
0 |
|a Computer science.
|
| 650 |
|
0 |
|a Computer communication systems.
|
| 650 |
|
0 |
|a Data structures (Computer science).
|
| 650 |
|
0 |
|a Algorithms.
|
| 650 |
|
0 |
|a Computer science
|x Mathematics.
|
| 650 |
|
0 |
|a Discrete mathematics.
|
| 650 |
1 |
4 |
|a Computer Science.
|
| 650 |
2 |
4 |
|a Discrete Mathematics in Computer Science.
|
| 650 |
2 |
4 |
|a Computer Communication Networks.
|
| 650 |
2 |
4 |
|a Discrete Mathematics.
|
| 650 |
2 |
4 |
|a Data Structures.
|
| 650 |
2 |
4 |
|a Algorithm Analysis and Problem Complexity.
|
| 650 |
2 |
4 |
|a Algorithms.
|
| 700 |
1 |
|
|a Brandes, Ulrik.
|e editor.
|
| 700 |
1 |
|
|a Erlebach, Thomas.
|e editor.
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540249795
|
| 830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 3418
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/b106453
|z Full Text via HEAL-Link
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (Springer-11645)
|
