Connection Subgraphs: A Survey

Mining large graphs to discover relationships between two or more nodes is an important problem. This study presents a literature review on a specific formulation of that problem which is referred to as the connection subgraph problem. Connection subgraphs are useful in many applications such as ranking search results, discovering connections between criminals or terrorists, identifying connections between two genes, exploiting product relationships to increase product sales and visualizing large graphs. The study also presents suggestions for future research directions.