Near-Linear-Time, Optimal Vertex Cut Sparsifiers in Directed Acyclic Graphs.

Zhiyang He Jason Li Magnus Wahlström

Published in: ESA (2021)

Keyphrases

directed acyclic graph
undirected graph
directed graph
equivalence class
worst case
equivalence classes
causal models
structural learning
dynamic programming
minimum length
minimum cost
random variables
conditional independence
lower bound
optimal solution
rough set theory
bayesian networks