Overview
- Includes supplementary material: sn.pub/extras
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 3418)
Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)
Access this book
Tax calculation will be finalised at checkout
Other ways to access
About this book
‘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 content being viewed by others
Keywords
Table of contents (15 chapters)
-
Front Matter
-
Introduction
-
Back Matter
Editors and Affiliations
Bibliographic Information
Book Title: Network Analysis
Book Subtitle: Methodological Foundations
Editors: Ulrik Brandes, Thomas Erlebach
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/b106453
Publisher: Springer Berlin, Heidelberg
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer-Verlag Berlin Heidelberg 2005
Softcover ISBN: 978-3-540-24979-5Published: 09 February 2005
eBook ISBN: 978-3-540-31955-9Published: 02 February 2005
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XII, 472
Topics: Discrete Mathematics in Computer Science, Computer Communication Networks, Discrete Mathematics, Data Structures, Algorithm Analysis and Problem Complexity, Algorithms