The Complexity of Finding kth Most Probable Explanations in Probabilistic Networks
From MaRDI portal
Publication:3075529
DOI10.1007/978-3-642-18381-2_30zbMath1298.68202WikidataQ59567629 ScholiaQ59567629MaRDI QIDQ3075529
Hans L. Bodlaender, Johan Kwisthout, Linda C. van der Gaag
Publication date: 15 February 2011
Published in: SOFSEM 2011: Theory and Practice of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-18381-2_30
68R10: Graph theory (including graph drawing) in computer science
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
