Parameterized Complexity Results for Exact Bayesian Network Structure Learning

4 February 2014

Papers citing "Parameterized Complexity Results for Exact Bayesian Network Structure Learning"

7 / 7 papers shown

Title
Learning Dynamic Bayesian Networks from Data: Foundations, First Principles and Numerical Comparisons Vyacheslav Kungurtsev Fadwa Idlahcen Petr Rysavý Pavel Rytíř Ales Wodecki 101 1 0 25 Jun 2024
Efficient Bayesian network structure learning via local Markov boundary search Ming Gao Bryon Aragam 142 17 0 12 Oct 2021
Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis Niels Grüttemeier Christian Komusiewicz 56 21 0 30 Apr 2020
Lower Bounds for QBFs of Bounded Treewidth Johannes Fichte Markus Hecher A. Pfandler 44 24 0 02 Oct 2019
Pattern-Based Approach to the Workflow Satisfiability Problem with User-Independent Constraints Daniel Karapetyan Andrew J. Parkes G. Gutin A. Gagarin 29 17 0 19 Apr 2016
Selective Greedy Equivalence Search: Finding Optimal Bayesian Networks Using a Polynomial Number of Score Evaluations D. M. Chickering Christopher Meek 116 28 0 06 Jun 2015
On Finding Optimal Polytrees Serge Gaspers Mikko Koivisto M. Liedloff S. Ordyniak Stefan Szeider TPM 136 11 0 08 Aug 2012