Efficient and Effective Cohesive Subgraph Search in Bipartite Graphs

Bipartite graphs are an interesting structure that can model the relationships between two different types of entities in real-world scenarios such as customer-product and author-paper networks. Finding bipartite cohesive subgraphs is a fundamental problem aiming to find strongly connected subgraphs to better understand such bipartite graphs. The powerful traditional models for searching strongly connected patterns cannot fully explore the deeper insights of bipartite graphs, as they are defined on general graphs. Therefore, in this thesis, we first study the fundamental problem of enumerating all bipartite cohesive subgraphs and then present two new bipartite cohesive subgraph models for distinct real-world scenarios.