Batya Kenig

activity

20162025

most citedIntegrity Constraints Revisited: From Exact to Approximate Implication

7 citations · 12 across the 14 of their papers we have counts for

collaborators

Showing 2021Show all

2 papers · 1 filter

cs.DS2021

Enumerating Minimal Separators in Ranked Order

Batya Kenig

Let $G$ be an $n$ -vertex graph, and $s, t$ vertices of $G$ . We present an efficient algorithm which enumerates the set of minimal $s t$ -separators of $G$ in ascending order of cardin…

cs.AI2021

Approximate Implication with d-Separation

Batya Kenig

The graphical structure of Probabilistic Graphical Models (PGMs) encodes the conditional independence (CI) relations that hold in the modeled distribution. Graph algorithms, such a…