Models, Algorithms and Technologies for Network Analysis NET 2014, Nizhny Novgorod, Russia, May 2014 / edited by Valery A. Kalyagin, Petr A. Koldanov, Panos M. Pardalos.

The contributions in this volume cover a broad range of topics including maximum cliques, graph coloring, data mining, brain networks, Steiner forest, logistic and supply chain networks. Network algorithms and their applications to market graphs, manufacturing problems, internet networks and social...

Full description

Saved in:
Bibliographic Details
Corporate Author: SpringerLink (Online service)
Other Authors: Kalyagin, Valery A. (Editor), Koldanov, Petr A. (Editor), Pardalos, Panos M. (Editor)
Format: eBook
Language:English
Published: Cham : Springer International Publishing : Imprint: Springer, 2016.
Edition:1st ed. 2016.
Series:Springer Proceedings in Mathematics & Statistics, 156
Springer eBook Collection.
Subjects:
Online Access:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.
Description
Summary:The contributions in this volume cover a broad range of topics including maximum cliques, graph coloring, data mining, brain networks, Steiner forest, logistic and supply chain networks. Network algorithms and their applications to market graphs, manufacturing problems, internet networks and social networks are highlighted. The "Fourth International Conference in Network Analysis," held at the Higher School of Economics, Nizhny Novgorod in May 2014, initiated joint research between scientists, engineers and researchers from academia, industry and government; the major results of conference participants have been reviewed and collected in this Work. Researchers and students in mathematics, economics, statistics, computer science and engineering will find this collection a valuable resource filled with the latest research in network analysis.
Physical Description:XVI, 340 p. 107 illus., 82 illus. in color. online resource.
ISBN:9783319296081
ISSN:2194-1009 ;
DOI:10.1007/978-3-319-29608-1