๐”– Scriptorium
โœฆ   LIBER   โœฆ

๐Ÿ“

Network Science: Analysis and Optimization Algorithms for Real-World Applications

โœ Scribed by Carlos Andre Reis Pinheiro


Publisher
Wiley
Tongue
English
Leaves
352
Category
Library

โฌ‡  Acquire This Volume

No coin nor oath required. For personal study only.

โœฆ Synopsis


Network Science

Network Science offers comprehensive insight on network analysis and network optimization algorithms, with simple step-by-step guides and examples throughout, and a thorough introduction and history of network science, explaining the key concepts and the type of data needed for network analysis, ensuring a smooth learning experience for readers. It also includes a detailed introduction to multiple network optimization algorithms, including linear assignment, network flow and routing problems.

The text is comprised of five chapters, focusing on subgraphs, network analysis, network optimization, and includes a list of case studies, those of which include influence factors in telecommunications, fraud detection in taxpayers, identifying the viral effect in purchasing, finding optimal routes considering public transportation systems, among many others. This insightful book shows how to apply algorithms to solve complex problems in real-life scenarios and shows the math behind these algorithms, enabling readers to learn how to develop them and scrutinize the results.

Written by a highly qualified author with significant experience in the field, Network Science also includes information on:

  • Sub-networks, covering connected components, bi-connected components, community detection, k-core decomposition, reach network, projection, nodes similarity and pattern matching
  • Network centrality measures, covering degree, influence, clustering coefficient, closeness, betweenness, eigenvector, PageRank, hub and authority
  • Network optimization, covering clique, cycle, linear assignment, minimum-cost network flow, maximum network flow problem, minimum cut, minimum spanning tree, path, shortest path, transitive closure, traveling salesman problem, vehicle routing problem and topological sort

With in-depth and authoritative coverage of the subject and many case studies to convey concepts clearly, Network Science is a helpful training resource for professional and industry workers in, telecommunications, insurance, retail, banking, healthcare, public sector, among others, plus as a supplementary reading for an introductory Network Science course for undergraduate students.


๐Ÿ“œ SIMILAR VOLUMES


Network Science: Analysis and Optimizati
โœ Carlos Andre Reis Pinheiro ๐Ÿ“‚ Library ๐Ÿ“… 2022 ๐Ÿ› Wiley ๐ŸŒ English

<span>Network Science</span><p><span>Network Science</span><span> offers comprehensive insight on network analysis and network optimization algorithms, with simple step-by-step guides and examples throughout, and a thorough introduction and history of network science, explaining the key concepts and

Metaheuristic Optimization Algorithms -
โœ Laith Abualigah ๐Ÿ“‚ Library ๐Ÿ“… 2024 ๐Ÿ› Elsevier Inc. ๐ŸŒ English

Metaheuristic Optimization Algorithms: Optimizers, Analysis, and Applications presents the most recent optimization algorithms and their applications across a wide range of scientific and engineering research fields. The book provides readers with a comprehensive overview of eighteen optimization al

Network optimization problems : algorith
โœ Du D.-Z., Pardalos P.M. (eds.) ๐Ÿ“‚ Library ๐Ÿ“… 1993 ๐Ÿ› World Scientific ๐ŸŒ English

Group testing was first proposed for blood tests, but soon found its way to many industrial applications. Combinatorial group testing studies the combinatorial aspect of the problem and is particularly related to many topics in combinatorics, computer science and operations research. Recently, the i

Optimization algorithms for networks and
โœ J R Evans; Edward Minieka ๐Ÿ“‚ Library ๐Ÿ“… 1992 ๐Ÿ› Marcel Dekker ๐ŸŒ English

A revised and expanded advanced-undergraduate/graduate text (first ed., 1978) about optimization algorithms for problems that can be formulated on graphs and networks. This edition provides many new applications and algorithms while maintaining the classic foundations on which contemporary algorithm