1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.DS2026
Counting Small Balanced (p,q)-bicliques in Signed Bipartite Graphs
Mekala Kiran, Apurba Das, Suman Banerjee +1
Two disjoint sets of entities and their relationship can be modelled as a bipartite graph. Real-life examples include drug-target interaction in biological networks, user-item rela…
cs.DM2019★ 1 cited
Algorithm and hardness results on neighborhood total domination in graphs
Anupriya Jha, D. Pradhan, S. Banerjee
A set of a graph is called a neighborhood total dominating set of if is a dominating set and the subgraph of induced by the open neighborhood o…