Algebraic Bayesian networks: checking backbone connectivity

DOI10.1134/S1063454121020059zbMath1481.68038MaRDI QIDQ2047545

A. G. Maksimov, Alexander L. Tulupyev

Publication date: 20 August 2021

Published in: Vestnik St. Petersburg University. Mathematics (Search for Journal in Brave)

zbMATH Keywords

complexity of algorithmsjoint graphalgebraic Bayesian networksminimal joint graph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10) Reasoning under uncertainty in the context of artificial intelligence (68T37) Probabilistic graphical models (62H22)

Uses Software

• GMRFLib

Cites Work

• Unnamed Item
• Unnamed Item
• Symplectic spaces and ear-decomposition of matroids
• A simple test on 2-vertex- and 2-edge-connectivity
• Two heuristics for the rainbow spanning forest problem
• Finding the largest triangle in a graph in expected quadratic time
• Smoothed analysis of algorithms
• Worst-case Analysis of Set Union Algorithms
• Efficiency of a Good But Not Linear Set Union Algorithm
• Gaussian Markov Random Fields
• An efficient local search-based genetic algorithm for constructing optimal Latin hypercube design
• The Mondshein Sequence
• Towards conformal invariance of 2D lattice models

This page was built for publication: Algebraic Bayesian networks: checking backbone connectivity