Browse All Reviews
Data Structures (E.1)
> Graphs And Networks (E.1...)
All Media Types
1-8 of 8 Reviews about "
Graphs And Networks (E.1...)
Nonlinear Laplacian for digraphs and its applications to network analysis
Yoshida Y. WSDM 2016 (Proceedings of the 9th ACM International Conference on Web Search and Data Mining, San Francisco, CA, Feb 22-25, 2016) 483-492, 2016. Type: Proceedings
This paper relates to spectral graph theory and more specifically concerns the case of digraphs, directed graphs. It proposes an alternative framework to existing digraph approaches, such as Chung’s, or the Diplacian, relying...
Jul 28 2016
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
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 m...
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 da...
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
-spanner graph in Euclidean space provides a sparse network of paths between pairs of points; the paths are at most
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. ...
Aug 4 2004
Randomized fully dynamic graph algorithms with polylogarithmic time per operation
Henzinger M., King V. Journal of the ACM 46(4): 502-516, 1999. Type: Article
The authors present a technique for designing fully dynamic algorithms with polylogarithmic time per operation for dynamically testing several graph properties. The technique combines a new graph decomposition and randomization. The ed...
Mar 1 2000
Complete inverted files for efficient text retrieval and analysis
Blumer A., Blumer J., Haussler D., McConnell R., Ehrenfeucht A. Journal of the ACM 34(3): 578-595, 1987. Type: Article
The authors provide an excellent treatment of a new data structure for text analysis, called the compact directed acyclic word graph (compact DAWG). This data structure is both smaller than and functionally superior to conventional key...
Oct 1 1988
Reproduction in whole or in part without permission is prohibited. Copyright 1999-2023 ThinkLoud