Tag: Graph Theory and Algorithms
Algorithm enumerates maximal balanced quasi-cliques in signed graphs
Detecting balanced group structures in networks with positive and negative connections

Parallel conflict graph management reduced MIP solve time
Faster integer programming through parallel cutting plane generation

Temporal-clique query processing is made more efficient
Fast pattern matching in networks where structure and timing both matter








