activity
20192026
most citedA Computational Study of Exact Subgraph Based SDP Bounds for Max-Cut, Stable Set and Coloring

9 citations · 50 across the 22 of their papers we have counts for

collaborators
Showing 2024Show all

1 paper · 1 filter

math.OC2024

The exact subgraph hierarchy and its vertex-transitive variant for the stable set problem for Paley graphs

Elisabeth Gaar, Dunja Pucher

The stability number of a graph, defined as the cardinality of the largest set of pairwise non-adjacent vertices, is NP-hard to compute. The exact subgraph hierarchy (ESH) provides…