Doctoral Dissertations

Orcid ID

Date of Award


Degree Type


Degree Name

Doctor of Philosophy


Computer Engineering

Major Professor

Qing Cao

Committee Members

Wenjun Zhou, Michael Langston, Hairong Qi


Graphs are naturally used to model real-world networks. Among various types of graph, complex networks, which are a type of graphs (networks) that exhibits unique topology properties, e.g., power-law degree distribution and small diameters, are commonly found in real-world networks and has exposed new challenges for graph analysis. Due to the ever-increasing difficulty in running classic graph algorithms on large-scale graphs, a new type of graph problem, called query-dependent variants of graph problems have drawn raising attention. In this dissertation, we explore how to leverage index structures to design highly efficient algorithms for query-dependent graph problems. We first study point-to-point shortest paths problems in large-scale complex networks. We propose a decentralized search algorithm running on a landmark-based index structure constructed with a new concept called path degree. Due to the light weight of our online search algorithm, we build a distributed system that supports parallel processing of online queries to achieve high throughput. We demonstrate that our system can process hundreds of thousand queries per second on these graphs with higher accuracy and reduced overhead than the state-of-the-art works.We then study the local k-truss community query problem in large-scale complex networks. We generalize the community search problems by supporting both the community-level and the edge-level query with arbitrary cohesiveness criteria. We design a two-level index structure that processes both types of queries for a single or multiple vertices in optimal time. Our method outperforms the state-of-the-art works in both the community search problem and community-level problems by a large margin. Finally, we introduce a new data filter based on graph model and apply it for a real-world problem, which is inferring user mobility from coarse-grained location trace. We use the Voronoi Diagram to model cellular tower's coverage. We introduce a graph-based data filter with estimations of lower bounds of users' travelled distance. We apply the graph-based filter to our dataset to acquire clean user mobility data for further data analysis task.

Files over 3MB may be slow to open. For best results, right-click and select "save as..."