rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Network Analysis
    sub title: Methodological Foundations
  name:
    name part: Brandes, Ulrik.
    role:
      role term: editor.
  name:
    name part: Erlebach, Thomas.
    role:
      role term: editor.
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: gw
    date issued: 2005
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: XII, 472 p. online resource.
  abstract: ‘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.
  table of contents: 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.
  note: edited by Ulrik Brandes, Thomas Erlebach.
  subject:
    topic: Computer science
  subject:
    topic: Computer communication systems
  subject:
    topic: Data structures (Computer science)
  subject:
    topic: Algorithms
  subject:
    topic: Computer science
    topic: Mathematics
  subject:
    topic: Discrete mathematics
  subject:
    topic: Computer Science
  subject:
    topic: Discrete Mathematics in Computer Science
  subject:
    topic: Computer Communication Networks
  subject:
    topic: Discrete Mathematics
  subject:
    topic: Data Structures
  subject:
    topic: Algorithm Analysis and Problem Complexity
  subject:
    topic: Algorithms
  classification: QA76.9.M35
  classification: 004.0151
  related item:
    title info:
      title: Springer eBooks
  related item:
    title info:
      title: Lecture Notes in Computer Science, 3418
  identifier: 9783540319559
  identifier: http://dx.doi.org/10.1007/b106453
  record info:
    record creation date: 100924
    record change date: 20151204161427.0
    record identifier: 978-3-540-31955-9