Focal Interest
Focal Interest

Enumeration

  1. Algorithm enumerates maximal balanced quasi-cliques in signed graphs
    Discover maximal balanced quasi-clique enumeration for signed graphs. A novel NP-hard algorithm identifies cohesive subgraphs with positive and negative edges using branch-and-bound optimization.