|
|
|
|
| LEADER |
03664nmm a2200457 u 4500 |
| 001 |
EB002137926 |
| 003 |
EBX01000000000000001276053 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
230102 ||| eng |
| 020 |
|
|
|a 1119898927
|
| 020 |
|
|
|a 9781119898948
|
| 020 |
|
|
|a 9781119898924
|
| 020 |
|
|
|a 1119898943
|
| 050 |
|
4 |
|a TK5105.5
|
| 100 |
1 |
|
|a Pinheiro, Carlos Andre Reis
|
| 245 |
0 |
0 |
|a Network science
|b analysis and optimization algorithms for real-world applications
|c Carlos Andre Reis Pinheiro
|
| 260 |
|
|
|a Hoboken, NJ
|b John Wiley & Sons, Inc.
|c 2023
|
| 300 |
|
|
|a 1 online resource
|b illustrations (chiefly color), color maps
|
| 653 |
|
|
|a Information networks / http://id.loc.gov/authorities/subjects/sh85066145
|
| 653 |
|
|
|a Réseaux d'information
|
| 653 |
|
|
|a Réseaux d'ordinateurs
|
| 653 |
|
|
|a Computer networks / fast
|
| 653 |
|
|
|a Information networks / fast
|
| 653 |
|
|
|a Computer networks / http://id.loc.gov/authorities/subjects/sh85029513
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b OREILLY
|a O'Reilly
|
| 500 |
|
|
|a Includes index
|
| 776 |
|
|
|z 9781119898917
|
| 776 |
|
|
|z 1119898927
|
| 776 |
|
|
|z 1119898919
|
| 776 |
|
|
|z 9781119898948
|
| 776 |
|
|
|z 9781119898924
|
| 776 |
|
|
|z 1119898943
|
| 856 |
4 |
0 |
|u https://learning.oreilly.com/library/view/~/9781119898917/?ar
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 331
|
| 082 |
0 |
|
|a 004.6
|
| 520 |
|
|
|a 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,
|
| 520 |
|
|
|a among others, plus as a supplementary reading for an introductory Network Science course for undergraduate students
|
| 520 |
|
|
|a 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.
|
| 520 |
|
|
|a 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.
|