Models, Algorithms, and Technologies for Network Analysis
Home > Computing and Information Technology > Computer programming / software engineering > Algorithms and data structures > Models, Algorithms, and Technologies for Network Analysis: NET 2016, Nizhny Novgorod, Russia, May 2016
Models, Algorithms, and Technologies for Network Analysis: NET 2016, Nizhny Novgorod, Russia, May 2016

Models, Algorithms, and Technologies for Network Analysis: NET 2016, Nizhny Novgorod, Russia, May 2016

|
     0     
5
4
3
2
1




International Edition


About the Book

This valuable source for graduate students and researchers provides a comprehensive introduction to current theories and applications in optimization methods and network models. Contributions to this book are focused on new efficient algorithms and rigorous mathematical theories, which can be used to optimize and analyze mathematical graph structures with massive size and high density induced by natural or artificial complex networks. Applications to social networks, power transmission grids, telecommunication networks, stock market networks, and human brain networks are presented. Chapters in this book cover the following topics: Linear max min fairness Heuristic approaches for high-quality solutions Efficient approaches for complex multi-criteria optimization problems Comparison of heuristic algorithms New  heuristic iterative local search  Power in network structures Clustering nodes in random graphs Power transmission grid structure Network decomposition problems Homogeneity hypothesis testing Network analysis of international migration Social networks with node attributes Testing hypothesis on degree distribution in the market graphs Machine learning applications to human brain network studies  This proceeding is a result of The 6th International Conference on Network Analysis held at the Higher School of Economics, Nizhny Novgorod in May 2016. The conference brought together scientists and engineers from industry, government, and academia to discuss the links between network analysis and a variety of fields.

Table of Contents:
Linear Max Min Fairness in Multi-commodity Flow Networks (Hamoud Bin Obaid, Theodore B. Trafalis).- Heuristic for Maximizing Grouping Efficiency in the Cell Formation Problem (Ilya Bychkov, Mikhail Batsyn, Panos M. Pardalos).- Efficient Methods of Multicriterial Optimization Based on the Intensive Use of Search Information (Victor Gergel, Evgeny Kozinov).- Comparison of two heuristic algorithms for a location and design problem (Alexander Gnusarev).- A Class of Smooth Modification of Space-Filling Curves for Global Optimization Problems (Alexey Goryachih).- Iterative Local Search Heuristic for Truck and Trailer Routing Problem (Ivan S. Grechikhin).- Power in network structures (Fuad Aleskerov, Natalia Meshcheryakova, Sergey Shvydun).- Do logarithmic proximity measures outperform plain ones in graph clustering? (Vladimir Ivashkin, Pavel Chebotarev).- Analysis of Russian Power Transmission Grid Structure: Small World Phenomena Detection (Sergey Makrushin).- A new approach to network decomposition problems (Alexander Rubchinsky).- Homogeneity hypothesis testing for degree distribution in the market graph (Semenov D.P., Koldanov P.A.).- Network Analysis of International Migration (Fuad Aleskerov, Natalia Meshcheryakova, Anna Rezyapova, Sergey Shvydun).- Overlapping community detection in social networks with node attributes by neighborhood influence (Vladislav Chesnokov).- Testing hypothesis on degree distribution in the market graph (Koldanov P.A., Larushina J.D.).- Application of network analysis for FMCG distribution channels (Nadezda Kolesnik, Valentina Kuskova, Olga Tretyak).- Machine learning application to human brain network studies: a kernel approach (Anvar Kurmukov, Yulia Dodonova, Leonid Zhukov).- Co-author Recommender System (Ilya Makarov, Oleg Bulanov, Leonid Zhukov).- Network Studies in Russia: From Articles to the Structure of a Research Community (Daria Maltseva, Ilia Karpov).<


Best Sellers


Product Details
  • ISBN-13: 9783319860121
  • Publisher: Springer International Publishing AG
  • Binding: Paperback
  • Language: English
  • Returnable: Y
  • Sub Title: NET 2016, Nizhny Novgorod, Russia, May 2016
  • ISBN-10: 3319860127
  • Publisher Date: 02 Aug 2018
  • Height: 235 mm
  • No of Pages: 277
  • Returnable: N
  • Width: 155 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Models, Algorithms, and Technologies for Network Analysis: NET 2016, Nizhny Novgorod, Russia, May 2016
Springer International Publishing AG -
Models, Algorithms, and Technologies for Network Analysis: NET 2016, Nizhny Novgorod, Russia, May 2016
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Models, Algorithms, and Technologies for Network Analysis: NET 2016, Nizhny Novgorod, Russia, May 2016

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals

    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!