Sciweavers

2125 search results - page 134 / 425
» On Graph Complexity
Sort
View
KDD
2009
ACM
204views Data Mining» more  KDD 2009»
15 years 10 months ago
DOULION: counting triangles in massive graphs with a coin
Counting the number of triangles in a graph is a beautiful algorithmic problem which has gained importance over the last years due to its significant role in complex network analy...
Charalampos E. Tsourakakis, U. Kang, Gary L. Mille...
SIAMDM
2008
79views more  SIAMDM 2008»
14 years 10 months ago
Testing Triangle-Freeness in General Graphs
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...
Noga Alon, Tali Kaufman, Michael Krivelevich, Dana...
ICDIM
2008
IEEE
15 years 4 months ago
Dynamic detection and administration of materialized views based on the Query Graph Model
Database Management Systems (DBMS) are complex software systems which are used in an increasing number of applications. To obtain the best performance for business relevant applic...
Andreas Lübcke, Ingolf Geist, Ronny Bubke
ICDCS
2011
IEEE
13 years 9 months ago
Privacy-Preserving Query over Encrypted Graph-Structured Data in Cloud Computing
— In the emerging cloud computing paradigm, data owners become increasingly motivated to outsource their complex data management systems from local sites to the commercial public...
Ning Cao, Zhenyu Yang, Cong Wang, Kui Ren, Wenjing...
ICDAR
2011
IEEE
13 years 9 months ago
Symbol Spotting in Line Drawings through Graph Paths Hashing
—In this paper we propose a symbol spotting technique through hashing the shape descriptors of graph paths (Hamiltonian paths). Complex graphical structures in line drawings can ...
Anjan Dutta, Josep Lladós, Umapada Pal