Diverse Dense Correlated Subgraph Mining in Dynamic Networks

This repository contains a our work about the "Real-time Constrained Cycle Detection in Large Dynamic Graphs" paper, which present a GraphS system to efficiently detect constrained cycles in a dynamic graph, which is changing constantly, and return the satisfying cycles in real-time.

Goal of this academic project is to implement the Breadth First Search, Ford-Fulkerson Network flow algorithm and use it to solve the Circulation with Demands problem.

This repository contains a our work about the "How to Explore a Fast-Changing World" paper, where we cover the simple random walk on directed graphs and undirected graphs and the lazy random walk on dynamic graphs. In terms of the cover time.