04272nam a22005535i 4500 978-0-8176-4519-9 DE-He213 20260521092027.0 cr nn 008mamaa 100301s2007 xxu| s |||| 0|eng d 9780817645199 99780817645199 10.1007/978-0-8176-4519-9 doi 004.6 23 Bunke, Horst. author. A Graph-Theoretic Approach to Enterprise Network Dynamics [electronic resource] / by Horst Bunke, Peter J. Dickinson, Miro Kraetzl, Walter D. Wallis. Boston, MA : Birkhäuser Boston, 2007. XIII, 225 p. 110 illus. online resource. text txt rdacontent computer c rdamedia online resource cr rdacarrier text file PDF rda Progress in Computer Science and Applied Logic (PCS) ; 24 Intranets and Network Management -- Graph-Theoretic Concepts -- Event Detection Using Graph Distance -- Matching Graphs with Unique Node Labels -- Graph Similarity Measures for Abnormal Change Detection -- Median Graphs for Abnormal Change Detection -- Graph Clustering for Abnormal Change Detection -- Graph Distance Measures based on Intragraph Clustering and Cluster Distance -- Matching Sequences of Graphs -- Properties of the Underlying Graphs -- Distances, Clustering, and Small Worlds -- Tournament Scoring -- Prediction and Advanced Distance Measures -- Recovery of Missing Information in Graph Sequences -- Matching Hierarchical Graphs. Networks have become nearly ubiquitous and increasingly complex, and their support of modern enterprise environments has become fundamental. Accordingly, robust network management techniques are essential to ensure optimal performance of these networks. This monograph treats the application of numerous graph-theoretic algorithms to a comprehensive analysis of dynamic enterprise networks. Network dynamics analysis yields valuable information about network performance, efficiency, fault prediction, cost optimization, indicators and warnings. The exposition is organized into four relatively independent parts: an introduction and overview of typical enterprise networks and the graph theoretical prerequisites for all algorithms introduced later; an in-depth treatise of usage of various graph distances for event detection; a detailed exploration of properties of underlying graphs with modeling applications; and a theoretical and applied treatment of network behavior inferencing and forecasting using sequences of graphs. Based on many years of applied research on generic network dynamics, this work covers a number of elegant applications (including many new and experimental results) of traditional graph theory algorithms and techniques to computationally tractable network dynamics analysis to motivate network analysts, practitioners and researchers alike. The material is also suitable for graduate courses addressing state-of-the-art applications of graph theory in analysis of dynamic communication networks, dynamic databasing, and knowledge management. COMPUTER SCIENCE. COMPUTER NETWORK ARCHITECTURES. COMPUTER SYSTEM PERFORMANCE. COMPUTER SOFTWARE. MATHEMATICS. COMPUTER SCIENCE. COMPUTER SYSTEMS ORGANIZATION AND COMMUNICATION NETWORKS. SYSTEM PERFORMANCE AND EVALUATION. ALGORITHM ANALYSIS AND PROBLEM COMPLEXITY. APPLICATIONS OF MATHEMATICS. MATH APPLICATIONS IN COMPUTER SCIENCE. PROBABILITY AND STATISTICS IN COMPUTER SCIENCE. Dickinson, Peter J. author. Kraetzl, Miro. author. Wallis, Walter D. author. SpringerLink (Online service) Springer eBooks Printed edition: 9780817644857 Progress in Computer Science and Applied Logic (PCS) ; 24 http://dx.doi.org/10.1007/978-0-8176-4519-9 Ver el texto completo en las instalaciones del CICY ZDB-2-SCS ddc ER 35613 35613 0 0 ddc 0 0 LE CICY CICY EL 2025-10-06 0 004.6 2025-10-06 08:44:35 2025-10-06 ER