The dual polyhedron to the chordal graph polytope and the rebuttal of the chordal graph conjecture

DOI10.1016/J.IJAR.2021.07.014MaRDI QIDQ2060774zbMATH OpenOpenAlexWikidataFDO

Authors Milan Studený, James Cussens, Václav Kratochvíl

Publication date 13 December 2021

Published in International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ijar.2021.07.014

zbMATH Keywords

chordal graph polytopeclutter inequalitiesdual polyhedronlearning decomposable models

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

Recommendations

• Towards using the chordal graph polytope in learning decomposable models
• On the stable set polytope of a series-parallel graph
• On the minimum chordal completion polytope
• On the cut polytope
• scientific article; zbMATH DE number 3929064

Cites work

• A geometric view on learning Bayesian network structures
• Characteristic imsets for learning Bayesian network structure
• Estimating the dimension of a model
• scientific article; zbMATH DE number 3854804 (Why is no real title available?)
• scientific article; zbMATH DE number 1312984 (Why is no real title available?)
• scientific article; zbMATH DE number 513105 (Why is no real title available?)
• scientific article; zbMATH DE number 1033382 (Why is no real title available?)
• scientific article; zbMATH DE number 1134987 (Why is no real title available?)
• scientific article; zbMATH DE number 2150792 (Why is no real title available?)
• scientific article; zbMATH DE number 3804333 (Why is no real title available?)
• scientific article; zbMATH DE number 1860211 (Why is no real title available?)
• Learning Bayesian network structure: towards the essential graph by integer linear programming tools
• Learning Bayesian networks: The combination of knowledge and statistical data
• Learning maximum weighted (k+1)-order decomposable graphs by integer linear programming
• Lectures on Polytopes
• Polyhedral aspects of score equivalence in Bayesian network structure learning
• Probabilistic Networks and Expert Systems
• Towards using the chordal graph polytope in learning decomposable models

Cited in

(3)

• On the minimum chordal completion polytope
• Toric ideals of characteristic imsets via quasi-independence gluing
• Hyperplane representations of interventional characteristic imset polytopes

This page was built for publication: The dual polyhedron to the chordal graph polytope and the rebuttal of the chordal graph conjecture

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2060774)