NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs.
Sepp HartungAndré NichterleinPublished in: SIAM J. Discret. Math. (2015)
Keyphrases
- np hardness
- directed acyclic graph
- np hard
- structural learning
- fixed parameter tractable
- random variables
- approximation algorithms
- equivalence classes
- conditional independence
- mixed integer
- undirected graph
- directed graph
- single peaked
- causal models
- np complete
- worst case
- lower bound
- linear programming
- probability distribution
- special case
- bayesian networks
- genetic algorithm