NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs.

Sepp Hartung André Nichterlein

Published in: CiE (2012)

Keyphrases

np hardness
directed acyclic graph
np hard
approximation algorithms
structural learning
random variables

fixed parameter tractable
conditional independence
equivalence classes
mixed integer
directed graph
causal models

undirected graph
lower bound
optimal solution
sequential patterns
single peaked

np complete
markov chain
linear programming
graphical models
bayesian networks