Tag: Enumeration
Algorithm enumerates maximal balanced quasi-cliques in signed graphs
—
in AlgorithmDiscover 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.
