Research
Title : | Graph Clustering: A Theoretical Perspective |
Area of research : | Mathematical Sciences |
Principal Investigator : | Dr. Aritra Banik, National Institute Of Science Education And Research (NISER), Bhubaneswar, Odisha |
Timeline Start Year : | 2023 |
Timeline End Year : | 2026 |
Contact info : | aritrabanik@gmail.com |
Details
Executive Summary : | This proposal focuses on the graph clustering problem, a crucial step in large-scale data processing. It aims to study data represented as graphs, mainly from web and social network graphs. The main goal is to divide the graph into subgraphs that satisfy certain graph-theoretic properties, such as sparseness, perfect matching, and q-colorability. The proposal aims to explore properties such as shallow minor freeness, perfect matching, and q-colorability. The project aims to start a new direction in graph clustering research by examining the properties of each subgraph, aiming to improve the efficiency of data processing. |
Total Budget (INR): | 6,60,000 |
Organizations involved
Implementing Agency : | National Institute Of Science Education And Research (NISER), Bhubaneswar, Odisha Funding Agency :Anusandhan National Rsearch Foundation (ANRF)/Science and Engineering Research Board (SERB) | Source:Science and Engineering Research Board (SERB), DST 2022-23 | |