Learning Maximum Weighted (k+1)-Order Decomposable Graphs by Integer Linear Programming

DOI10.1007/978-3-319-11433-0_26zbMath1443.68152OpenAlexW2293823337MaRDI QIDQ2938422

Christian Blum, Aritz Pérez, José A. Lozano

Publication date: 14 January 2015

Published in: Probabilistic Graphical Models (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-11433-0_26

zbMATH Keywords

integer linear programmingbounded clique sizedecomposable graphmaximum weighted graph problem

Mathematics Subject Classification ID

Integer programming (90C10) Learning and adaptive systems in artificial intelligence (68T05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Signed and weighted graphs (05C22) Probabilistic graphical models (62H22)

Related Items (2)

Towards using the chordal graph polytope in learning decomposable models ⋮ The dual polyhedron to the chordal graph polytope and the rebuttal of the chordal graph conjecture

This page was built for publication: Learning Maximum Weighted (k+1)-Order Decomposable Graphs by Integer Linear Programming