12 citations · 21 across the 8 of their papers we have counts for
3 papers · 1 filter
Graphs with polynomially many minimal separators
Tara Abrishami, Maria Chudnovsky, Cemil Dibek +3
We show that graphs that do not contain a theta, pyramid, prism, or turtle as an induced subgraph have polynomially many minimal separators. This result is the best possible in the…
Evolution of Q Values for Deep Q Learning in Stable Baselines
Matthew Andrews, Cemil Dibek, Karina Palyutina
We investigate the evolution of the Q values for the implementation of Deep Q Learning (DQL) in the Stable Baselines library. Stable Baselines incorporates the latest Reinforcement…
New Examples of Minimal Non-Strongly-Perfect Graphs
Maria Chudnovsky, Cemil Dibek, Paul Seymour
A graph is strongly perfect if every induced subgraph H has a stable set that meets every nonempty maximal clique of H. The characterization of strongly perfect graphs by a set of…