Search for Topics All Reviews
	Browse All Reviews > Data (E) > Data Structures (E.1) > Graphs And Networks (E.1...)     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending     1-10 of 45 Reviews about "Graphs And Networks (E.1...)": Date Reviewed   Scale free interval graphs Miyoshi N., Shigezumi T., Uehara R., Watanabe O.  Theoretical Computer Science 410(45): 4588-4600, 2009. Type: Article Generating realistic graphs is a very important tool, since this process can lead to synthetic graphs with properties that characterize real-life networks. Therefore, synthetically generated graphs can be used in performance evaluation... Jan 29 2010   Unassailable sensor networks Mei A., Panconesi A., Radhakrishnan J.  SecureComm 2008 (Proceedings of the 4th International Conference on Security and Privacy in Communication Networks, Istanbul, Turkey,  Sep 22-25, 2008) 1-10, 2008. Type: Proceedings Due to their intrinsic openness, wireless networks attract more attacks than wired networks. Security is a crucial and difficult issue for wireless networks. Much research effort is devoted to this important field, and numerous security protocols ... Mar 24 2009   Networks: from biology to theory Feng J., Jost J., Qian M.,  Springer-Verlag New York, Inc., Secaucus, NJ, 2007. 342 pp. Type: Book Neuroscience and bioinformatics are two research areas that deal with complex data sets and try to solve difficult problems. Fortunately, recent advances in mathematics and computer science offer the necessary tools to model and handle such... Jul 25 2007   Detachments of complete graphs Edwards K.  Combinatorics, Probability and Computing 14(3): 275-310, 2005. Type: Article This paper relates two properties of graphs—detachment and harmonious chromatic number—and obtains many new and interesting results. A detachment of a graph is obtained by splitting each vertex into one or more subvertices... May 9 2007   GXL: a graph-based standard exchange format for reengineering Holt R., Schürr A., Sim S., Winter A.  Science of Computer Programming 60(2): 149-170, 2006. Type: Article GXL provides a standardized notation for exchanging graphs, together with their structure definition, using Extensible Markup Language (XML) documents. Section 2 describes a variety of reengineering tools using graphs as an internal data... Apr 27 2007   Deformable spanners and applications Gao J., Guibas L., Nguyen A.  Computational geometry (Proceedings of the 20th Annual Symposium on Computational Geometry, Brooklyn, New York, USA,  Jun 8-11, 2004) 190-199, 2004. Type: Proceedings An s-spanner graph in Euclidean space provides a sparse network of paths between pairs of points; the paths are at most s times longer than the distance between their endpoints.... Sep 13 2004   Fighting against two adversaries: page migration in dynamic networks Bienkowski M., Korzeniowski M., auf der Heide F.  Parallelism in algorithms and architectures (Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, Barcelona, Spain,  Jun 27-30, 2004) 64-73, 2004. Type: Proceedings Data management problems arise in a distributed network of processors where copies of shared variables are stored. One basic problem of the file allocation is page migration, where only one copy of the file can be kept in the network. During... Aug 4 2004   Axiom of choice and chromatic number of the plane Shelah S., Soifer A.  Journal of Combinatorial Theory Series A 103(2): 387-391, 2003. Type: Article The question of the chromatic number of the plane has been unresolved for over 50 years. Informally, the question asks: How many colors are needed to paint the plane so that no two points a unit distance apart are painted the... Jun 23 2004   Software framework for managing heterogeneity in mobile collaborative systems Correa C., Marsic I.  Supporting group work (Proceedings of the 2003 international ACM SIGGROUP conference, Sanibel Island, Florida, USA,  Nov 9-12, 2003) 125-134, 2003. Type: Proceedings How can an application be tailored for different computing and communication environments? This paper presents a software framework for collaboration that addresses consistency, along with differences in user interests, in domains, and in device... Apr 5 2004    Algorithms in Java, part 5: graph algorithms Sedgewick R., Schidlowsky M.,  Addison-Wesley Longman Publishing Co, Inc., Boston, MA, 2003. 497 pp. Type: Book, Reviews: (2 of 2) Sedgewick has written several popular and well-known texts on algorithms. Schidlowsky is a Java consultant. This book is volume 2 of a Java version of a three-volume set. The three volumes together contain eight parts. Volume 1 [1] contains the... Feb 4 2004       Display 510152550100 per page
	Reproduction in whole or in part without permission is prohibited.   Copyright © 2000-2010 Reviews.com Terms of Use | Privacy Policy