Search for Topics All Reviews
	Browse All Reviews > Mathematics Of Computing (G) > Discrete Mathematics (G.2) > Graph Theory (G.2.2) > Network Problems (G.2.2...)     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending     1-10 of 51 Reviews about "Network Problems (G.2.2...)": Date Reviewed    A game theoretic model for the formation of navigable small-world networks--the tradeoff between distance and reciprocity Yang Z., Chen W. ACM Transactions on Internet Technology 18(4): 1-38, 2018.  Type: Article The concept of small-world networks has been developed to help explain how real whole-world social networks manage to be “navigable.” By navigable I mean the ease with which any two people can be connected with seem... Apr 25 2019   Efficient embedding of scale-free graphs in the hyperbolic plane Bläsius T., Laue S., Friedrich T., Krohmer A. IEEE/ACM Transactions on Networking 26(2): 920-933, 2018.  Type: Article This is an interesting paper from the graph embedding domain. Graph embedding deals with mapping the vertices of a graph to points in a space such that the metric distance in that space between vertices corresponds to actual edges of t... Jan 24 2019   Network science Barabási A., Cambridge University Press, Cambridge, UK, 2016. 474 pp.  Type: Book (978-1-107076-26-6) The study of networks has recently achieved some prominence due to the simple fact that networks of many different kinds surround us, from social and information networks to communication and transportation networks, not to mention the... Nov 5 2018   Complex networks: an algorithmic perspective Erciyes K., CRC Press, Inc., Boca Raton, FL, 2014. 320 pp.  Type: Book (978-1-466571-66-2), Reviews: (2 of 2) Complex networks, that is, networks with complex topological features, are ubiquitous in almost every branch of science and technology. As a result, the study of complex networks has become a significant focus of attention in various d... Jul 8 2015   Complex networks: an algorithmic perspective Erciyes K., CRC Press, Inc., Boca Raton, FL, 2014. 320 pp.  Type: Book (978-1-466571-66-2), Reviews: (1 of 2) Given the recent proliferation of books on networks, a skeptical reader might wonder whether yet another book on complex networks, also known as network science, deserves space on his or her shelf. In this particular case, the answer d... Mar 25 2015   Networks: optimisation and evolution Whittle P., Cambridge University Press, New York, NY, 2012. 282 pp.  Type: Book (978-1-107410-72-5), Reviews: (2 of 2) When someone mentions network optimization, network flow is probably the first thing you think about. However, the maximum flow problem, first solved by Ford and Fulkerson [1], and its generalizations, such as the circulation problem, ... Mar 22 2013   Networks: optimisation and evolution Whittle P., Cambridge University Press, New York, NY, 2012. 282 pp.  Type: Book (978-1-107410-72-5), Reviews: (1 of 2) Researchers in network optimization will find this book really refreshing. They are used to dealing with network flows, resource allocation, routing selection, and topological design, all of which typically involve linear programming. ... Feb 14 2013   Algorithms for minimum m-connected k-tuple dominating set problem Shang W., Wan P., Yao F., Hu X. Theoretical Computer Science 381(1-3): 241-247, 2007.  Type: Article The need for all of the wireless nodes in a wireless sensor network to frequently flood the network with control messages introduces the problems of redundancy, contentions, and collisions on the network. The authors attempt to solve t... Jan 10 2008   Frugal path mechanisms Archer A., Tardos É. ACM Transactions on Algorithms 3(1): 3-es, 2007.  Type: Article The bidding dynamics of teams competing for a task are the focus of this paper. The problem can be modeled as a path selection problem in a network environment. The goal is to show if a mechanism exists that will ensure frugality or re... May 3 2007   Routing, flow, and capacity design in communication and computer networks Pióro M., Medhi D., Morgan Kaufmann Publishers Inc., San Francisco, CA, 2004. 800 pp.  Type: Book (9780125571890) There is no single well-known recipe explaining how to design telecommunication networks. Therefore, modeling and comparing different approaches is very important before choosing the solution to be implemented. Network design models ba... Dec 22 2005       Display 510152550100 per page
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy