An inference algorithm for monotone Boolean functions associated with undirected graphs

DOI10.14529/MMP160302MaRDI QIDQ2830891zbMATH OpenOpenAlexFDO

Authors D. N. Gainanov, V. A. Rasskazova

Publication date 1 November 2016

Published in Vestnik Yuzhno-Ural'skogo Gosudarstvennogo Universiteta. Seriya Matematicheskoe Modelirovanie i Programmirovanie (Search for Journal in Brave)

Full work available at URL https://doi.org/10.14529/mmp160302

zbMATH Keywords

algorithm of searching for maximal upper zeros of a monotone Boolean functiongraphmonotone Boolean functionupper zero of a monotone Boolean function

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms (68W40)

Recommendations

• scientific article; zbMATH DE number 4055688
• scientific article; zbMATH DE number 4204285
• scientific article; zbMATH DE number 4095384
• On an approximate computation of the height of the maximal upper zero of a monotone Boolean function
• scientific article; zbMATH DE number 165544

Cited in

(1)

• The decomposition problem for the set of paths in a directed graph and its application

This page was built for publication: An inference algorithm for monotone Boolean functions associated with undirected graphs

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