6 results on '"Balasundaram, Balabhaskar"'
Search Results
2. Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
3. On Fault-Tolerant Low-Diameter Clusters in Graphs.
4. Approaches for finding cohesive subgroups in large-scale social networks via maximum k-plex detection.
5. On the 2-Club Polytope of Graphs.
6. A branch-and-bound approach for maximum quasi-cliques.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.