Decomposing DAGs into spanning trees: A new way to compress transitive closures.
Yangjun ChenYibin ChenPublished in: ICDE (2011)
Keyphrases
- spanning tree
- transitive closure
- directed acyclic graph
- edge disjoint
- minimum spanning tree
- minimum cost
- undirected graph
- minimum spanning trees
- equivalence class
- data compression
- causal models
- directed graph
- equivalence classes
- random variables
- edge weights
- expressive power
- depth first search
- np hard
- weighted graph
- special case
- belief networks
- query evaluation
- total length
- upper bound