Standard

Asymptotic analysis of a direct algorithm for synthesizing a minimal joint graph. / Maksimov, Anatolii; Zavalishin, Arseniy; Tulupyev, Alexander.

в: CEUR Workshop Proceedings, Том 2782, 2020, стр. 76-79.

Результаты исследований: Научные публикации в периодических изданиях › статья в журнале по материалам конференции › Рецензирование

Harvard

Maksimov, A, Zavalishin, A & Tulupyev, A 2020, 'Asymptotic analysis of a direct algorithm for synthesizing a minimal joint graph', CEUR Workshop Proceedings, Том. 2782, стр. 76-79.

APA

Maksimov, A., Zavalishin, A., & Tulupyev, A. (2020). Asymptotic analysis of a direct algorithm for synthesizing a minimal joint graph. CEUR Workshop Proceedings, 2782, 76-79.

Vancouver

Maksimov A, Zavalishin A, Tulupyev A. Asymptotic analysis of a direct algorithm for synthesizing a minimal joint graph. CEUR Workshop Proceedings. 2020;2782:76-79.

Author

Maksimov, Anatolii ; Zavalishin, Arseniy ; Tulupyev, Alexander. / Asymptotic analysis of a direct algorithm for synthesizing a minimal joint graph. в: CEUR Workshop Proceedings. 2020 ; Том 2782. стр. 76-79.

BibTeX

@article{89d6f9067420494b9a8f25062228242e,
title = "Asymptotic analysis of a direct algorithm for synthesizing a minimal joint graph",
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.",
keywords = "Algebraic Bayesian networks, Algorithms on graphs, Complexity of algorithms, Depth-first search, Joint graphs, Labeled graph",
author = "Anatolii Maksimov and Arseniy Zavalishin and Alexander Tulupyev",
note = "Publisher Copyright: {\textcopyright} 2020 CEUR-WS. All rights reserved.; Russian 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 ; Conference date: 29-06-2020 Through 01-07-2020",
year = "2020",
language = "English",
volume = "2782",
pages = "76--79",
journal = "CEUR Workshop Proceedings",
issn = "1613-0073",
publisher = "RWTH Aahen University",

}

RIS

TY - JOUR

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

AU - Maksimov, Anatolii

AU - Zavalishin, Arseniy

AU - Tulupyev, Alexander

N1 - Publisher Copyright: © 2020 CEUR-WS. All rights reserved.

PY - 2020

Y1 - 2020

N2 - 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.

AB - 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.

KW - Algebraic Bayesian networks

KW - Algorithms on graphs

KW - Complexity of algorithms

KW - Depth-first search

KW - Joint graphs

KW - Labeled graph

UR - http://www.scopus.com/inward/record.url?scp=85099063288&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:85099063288

VL - 2782

SP - 76

EP - 79

JO - CEUR Workshop Proceedings

JF - CEUR Workshop Proceedings

SN - 1613-0073

T2 - Russian 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

Y2 - 29 June 2020 through 1 July 2020

ER -

ID: 88231256