2 citations · 2 across the 6 of their papers we have counts for
Showing 2024Show all
3 papers · 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…
math.OC2024★ 2 cited
Quantum computing and the stable set problem
Aljaž Krpan, Janez Povh, Dunja Pucher
Given an undirected graph, the stable set problem asks to determine the cardinality of the largest subset of pairwise non-adjacent vertices. This value is called the stability numb…
math.OC2024
Practical Experience with Stable Set and Coloring Relaxations
Dunja Pucher, Franz Rendl
The stable set problem and the graph coloring problem are classes of NP-hard optimization problems on graphs. It is well known that even near-optimal solutions for these problems a…