//]]>

Structural Analysis of Complex Networks (Record no. 22644)

000 -LEADER
fixed length control field 04221nam a22004935i 4500
003 - CONTROL NUMBER IDENTIFIER
control field OSt
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20140310151441.0
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION
fixed length control field cr nn 008mamaa
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 101029s2011 xxu| s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9780817647896
978-0-8176-4789-6
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number T57-57.97
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 519
Edition number 23
264 #1 -
-- Boston :
-- Birkhäuser Boston,
-- 2011.
912 ## -
-- ZDB-2-SMA
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Dehmer, Matthias.
Relator term editor.
245 10 - IMMEDIATE SOURCE OF ACQUISITION NOTE
Title Structural Analysis of Complex Networks
Medium [electronic resource] /
Statement of responsibility, etc edited by Matthias Dehmer.
300 ## - PHYSICAL DESCRIPTION
Extent XIV, 478p. 85 illus.
Other physical details online resource.
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note Preface -- A Brief Introduction to Complex Networks and Their Analysis -- Partitions of Graphs -- Distance in Graphs -- Domination in Graphs -- Spectrum and Entropy for Infinite Directed Graphs -- Application of Infinite Labeled Graphs to Symbolic Dynamical Systems -- Decompositions and Factorizations of Complete Graphs -- Geodetic Sets in Graphs -- Graph Polynomials and Their Applications I: The Tutte Polynomial -- Graph Polynomials and Their Applications II: Interrelations and Interpretations -- Reconstruction Problems for Graphs, Krawtchouk Polynomials, and Diophantine Equations -- Subgraphs as a Measure of Similarity -- A Chromatic Metric on Graphs -- Some Applications of Eigenvalues of Graphs -- Minimum Spanning Markovian Trees: Introducing Context-Sensitivity Into the Generation of Spanning Trees -- Link-Based Network Mining -- Graph Representations and Algorithms in Computational Biology of RNA Secondary Structure -- Inference of Protein Function from the Structure of Interaction Networks -- Applications of Perfect Matchings in Chemistry -- Index.
520 ## - SUMMARY, ETC.
Summary, etc Because of the increasing complexity and growth of real-world networks, their analysis by using classical graph-theoretic methods is oftentimes a difficult procedure. As a result, there is a strong need to combine graph-theoretic methods with mathematical techniques from other scientific disciplines, such as machine learning and information theory, in order to analyze complex networks more adequately. Filling a gap in literature, this self-contained book presents theoretical and application-oriented results to structurally explore complex networks. The work focuses not only on classical graph-theoretic methods, but also demonstrates the usefulness of structural graph theory as a tool for solving interdisciplinary problems. Special emphasis is given to methods related to the following areas: * Applications to biology, chemistry, linguistics, and data analysis * Graph colorings * Graph polynomials * Information measures for graphs * Metrical properties of graphs * Partitions and decompositions * Quantitative graph measures Structural Analysis of Complex Networks is suitable for a broad, interdisciplinary readership of researchers, practitioners, and graduate students in discrete mathematics, statistics, computer science, machine learning, artificial intelligence, computational and systems biology, cognitive science, computational linguistics, and mathematical chemistry. The book may be used as a supplementary textbook in graduate-level seminars on structural graph analysis, complex networks, or network-based machine learning methods.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Mathematics.
Topical term or geographic name as entry element Computer Communication Networks.
Topical term or geographic name as entry element Computational complexity.
Topical term or geographic name as entry element Data mining.
Topical term or geographic name as entry element Bioinformatics.
Topical term or geographic name as entry element Combinatorics.
Topical term or geographic name as entry element Mathematics.
Topical term or geographic name as entry element Applications of Mathematics.
Topical term or geographic name as entry element Discrete Mathematics in Computer Science.
Topical term or geographic name as entry element Combinatorics.
Topical term or geographic name as entry element Computer Communication Networks.
Topical term or geographic name as entry element Computational Biology/Bioinformatics.
Topical term or geographic name as entry element Data Mining and Knowledge Discovery.
710 2# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element SpringerLink (Online service)
773 0# - HOST ITEM ENTRY
Title Springer eBooks
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Display text Printed edition:
International Standard Book Number 9780817647889
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier http://dx.doi.org/10.1007/978-0-8176-4789-6
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme
Item type E-Book
Copies
Price effective from Permanent location Date last seen Not for loan Date acquired Source of classification or shelving scheme Koha item type Damaged status Lost status Withdrawn status Current location Full call number
2014-04-09AUM Main Library2014-04-09 2014-04-09 E-Book   AUM Main Library519

Languages: 
English |
العربية