Balasundaram Balabhaskar

Balabhaskar Balasundaram

Information about the author Balabhaskar Balasundaram will soon be added to the site.
Found 4 papers in total
Approaches for finding cohesive subgroups in large-scale social networks via maximum k-plex detection
Approaches for finding cohesive subgroups in large-scale social networks via maximum k-plex detection
2017
A k‐plex is a clique relaxation introduced in social network analysis to model...
On the 2-Club Polytope of Graphs
On the 2-Club Polytope of Graphs
2016
A k ‐club is a subset of vertices of a graph that induces a subgraph of...
Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
2013
Given a simple undirected graph, the problem of finding a maximum subset of vertices...
Clique Relaxations in Social Network Analysis: The Maximum k‐Plex Problem
Clique Relaxations in Social Network Analysis: The Maximum k‐Plex Problem
2011
This paper introduces and studies the maximum k‐plex problem , which arises in...
Papers per page: