N
Ning Ruan
Researcher at Kent State University
Publications - 19
Citations - 1176
Ning Ruan is an academic researcher from Kent State University. The author has contributed to research in topics: Reachability & Transitive closure. The author has an hindex of 12, co-authored 19 publications receiving 1051 citations. Previous affiliations of Ning Ruan include Beihang University.
Papers
More filters
Book ChapterDOI
A Survey of Algorithms for Dense Subgraph Discovery
TL;DR: This chapter will discuss and organize the literature on this topic effectively in order to make it much more accessible to the reader.
Proceedings ArticleDOI
3-HOP: a high-compression indexing scheme for reachability query
TL;DR: A new 3-hop indexing scheme for directed graphs with higher density over dense DAGs with minimum index size is proposed and an efficient algorithm is developed to discover a transitive closure contour, which yields near optimal index size.
Proceedings ArticleDOI
Efficiently answering reachability queries on very large directed graphs
TL;DR: This paper introduces a novel graph structure, referred to as path-tree, to help labeling very large graphs, which is a spanning subgraph of G in a tree shape and demonstrates both analytically and empirically the effectiveness of the new approaches.
Proceedings ArticleDOI
Computing label-constraint reachability in graph databases
TL;DR: This work introduces a novel tree-based index framework which utilizes the directed maximal weighted spanning tree algorithm and sampling techniques to maximally compress the generalized transitive closure for the labeled graphs.
Proceedings ArticleDOI
A highway-centric labeling approach for answering distance queries on large sparse graphs
TL;DR: A novel labeling scheme, referred to as Highway-Centric Labeling, for answering distance queries in a large sparse graph that empowers the distance labeling with a highway structure and leverages a novel bipartite set cover framework/algorithm.