Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs.
Stefan KratschMarcin PilipczukMichal PilipczukMagnus WahlströmPublished in: SIAM J. Discret. Math. (2015)
Keyphrases
- directed acyclic graph
- fixed parameter tractability
- np hard
- single peaked
- equivalence class
- fixed parameter tractable
- structural learning
- conditional independence
- directed graph
- causal models
- random variables
- np complete
- computationally hard
- equivalence classes
- optimal solution
- approximation algorithms
- global constraints
- computational complexity
- multi agent systems