Sale!

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

eBook Details

  • Author: Carlos Andre Reis Pinheiro
  • File Size: 41 MB
  • Format: PDF
  • Length: 352 Pages
  • Publisher: Wiley; 1st edition
  • Publication Date: October 20, 2022
  • Language: English
  • ASIN: B0BK2SM14H
  • ISBN-10: 1119898919
  • ISBN-13: 9781119898917

Original price was: $81.00.Current price is: $16.00.

We're processing your payment...
Please DO NOT close this page!

- OR -
SKU: network-science-analysis-and-optimization-algorithms-for-real-world-applications-ebook Categories: , , , Tags: ,

About The Author

Carlos Andre Reis Pinheiro

Network Science: Analysis and Optimization Algorithms for Real-World Applications (PDF) provides comprehensive insights into network analysis and optimization algorithms. It offers step-by-step guides and examples, along with an introduction to network science and its history. The book explains the key concepts and the type of data needed for network analysis, making it easy for readers to understand. It also includes a detailed introduction to various network optimization algorithms, such as linear assignment, network flow, and routing problems.

The textbook consists of five chapters that focus on subgraphs, network analysis, network optimization, and includes a list of case studies. These case studies cover various real-world applications, including influence factors in telecommunications, fraud detection in taxpayers, identifying viral effects in purchasing, and finding optimal routes considering public transportation systems. The book demonstrates how to apply algorithms to solve complex problems in real-life scenarios and provides the underlying mathematics behind these algorithms, enabling readers to develop and analyze them.

Written by a highly qualified author with significant experience in the field, Network Science also covers network centrality measures, sub-networks, and network optimization. This includes topics such as degree, closeness, betweenness, eigenvector, PageRank, influence, clustering coefficient, hub, authority, connected components, bi-connected components, community detection, k-core decomposition, reach network, projection, nodes similarity, pattern matching, clique, cycle, 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 its in-depth coverage and authoritative information, Network Science is a valuable resource for professionals and industry workers in sectors like telecommunications, insurance, retail, banking, healthcare, and the public sector. It is also suitable as supplementary reading for undergraduate students taking an introductory Network Science course.

NOTE: The sale only includes the eBook Network Science: Analysis and Optimization Algorithms for Real-World Applications in PDF format. No access codes are included.