Asymptotic analysis of a direct algorithm for synthesizing a minimal joint graph

Research output: Contribution to journalConference articlepeer-review

Abstract

Joint graphs are currently the primary way to define the global structure of algebraic Bayesian networks. In this paper, we give an overview of a direct algorithm for the synthesis of a minimal joint graph and carry out its asymptotic analysis. We also describe ways to achieve maximum efficiency. From a theoretical point of view, the problem has not been discussed previously.

Original languageEnglish
Pages (from-to)76-79
Number of pages4
JournalCEUR Workshop Proceedings
Volume2782
StatePublished - 2020
EventRussian Advances in Fuzzy Systems and Soft Computing: Selected Contributions to the 8th International Conference on "Fuzzy Systems, Soft Soft Computing and Intelligent Technologies",FSSCIT 2020 - Smolensk, Russian Federation
Duration: 29 Jun 20201 Jul 2020

Scopus subject areas

  • Computer Science(all)

Keywords

  • Algebraic Bayesian networks
  • Algorithms on graphs
  • Complexity of algorithms
  • Depth-first search
  • Joint graphs
  • Labeled graph

Fingerprint

Dive into the research topics of 'Asymptotic analysis of a direct algorithm for synthesizing a minimal joint graph'. Together they form a unique fingerprint.

Cite this