ENGLISH

Network Analysis: Methodological Foundations

By Ulrik Brandes , Thomas Erlebach (auth.) , Thomas Erlebach (eds.)

Book information

Publisher
Springer-Verlag Berlin Heidelberg
Year
2005
ISBN
9783540249795, 3-540-24979-6
DOI
10.1007/b106453
ISSN
0302-9743
LCC
QA402 .N48 2005
Open Library ID
OL3479866M
Language
english
Format
PDF
Filesize
4 MB (4138024 bytes)
Series
Lecture Notes in Computer Science 3418 : Theoretical Computer Science and General Issues
Edition
1
Pages
472\482
Library
Kolxo3
Time added
2009-07-20 03:45:11
Discrete Mathematics in Computer Science; ComputerNetworks

Description

‘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.

Similar books