• Publications
  • Influence
Fg-index: towards verification-free query processing on graph databases
TLDR
A novel indexing technique that constructs a nested inverted-index, called FG- index, based on the set of Frequent subGraphs (FGs), which returns the exact set of query answers without performing candidate verification and is orders of magnitude more efficient than using the state-of-the-art graph index. Expand
Truss Decomposition in Massive Networks
TLDR
This work improves the existing in-memory algorithm for computing k-truss in networks of moderate size and proposes two I/O-efficient algorithms to handle massive networks that cannot fit in main memory. Expand
Blogel: A Block-Centric Framework for Distributed Computation on Real-World Graphs
TLDR
This paper proposes a block-centric framework, called Blogel, which naturally handles all the three adverse graph characteristics, and is able to achieve orders of magnitude performance improvements over the state-of-the-art distributed graph computing systems. Expand
K-isomorphism: privacy preserving network publication against structural attacks
TLDR
These investigations show that k-isomorphism, or anonymization by forming k pairwise isomorphic subgraphs, is both sufficient and necessary for the protection of privacy in social networks and the problem is shown to be NP-hard. Expand
A model-based approach to attributed graph clustering
TLDR
This paper develops a Bayesian probabilistic model for attributed graphs that provides a principled and natural framework for capturing both structural and attribute aspects of a graph, while avoiding the artificial design of a distance measure. Expand
Path Problems in Temporal Graphs
TLDR
The shortcomings of classic shortest path in a temporal graph are shown, various concepts of "shortest" path for temporal graphs are studied, and efficient algorithms to compute these temporal paths are proposed. Expand
TF-Label: a topological-folding labeling scheme for reachability querying in a large graph
TLDR
TF-label is an efficient and scalable labeling scheme for processing reachability queries that is constructed based on a novel topological folding that recursively folds an input graph into half so as to reduce the label size, thus improving query efficiency. Expand
Trace Norm Regularized CANDECOMP/PARAFAC Decomposition With Missing Data
TLDR
A novel trace norm regularized CANDECOMP/PARAFAC decomposition (TNCP) method for simultaneous tensor decomposition and completion that is significantly faster than the state-of-the-art methods and scales to larger problems. Expand
Triangle listing in massive networks and its applications
TLDR
This work proposes an I/O-efficient algorithm for triangle listing that is scalable and outperforms the state-of-the-art local triangle estimation algorithm and avoids random disk access. Expand
Effective Techniques for Message Reduction and Load Balancing in Distributed Graph Computation
TLDR
Two effective message reduction techniques are proposed: vertex mirroring with message combining, and an additional request-respond API that bound the number of messages sent/received by any single vertex. Expand
...
1
2
3
4
5
...