Research
My research projects are listed here. Further details are available by clicking on each project.
Enumerate Maximal Pseudo-cliques
Dense groups of nodes in a network often correspond to real structure: communities in social graphs, complexes in protein networks, and so on. Finding all of them exactly is computationally hard, so most methods settle for approximations that can miss results. This project presents FPCE, an exact pseudo-clique enumerator that returns the complete set while running substantially faster than existing exact algorithms.
Vertex-cover Problem
A vertex cover is a set of nodes that touches every edge in a graph; finding the smallest one is a classic, computationally hard problem with broad applications. This project develops an approximation algorithm to find minimal or near-minimal vertex covers efficiently on large networks. (Ongoing.)