A Suboptimal Stellate Structure of an Algebraic Bayesian Network
There has been pointed out a subclass of minimal adjacency graphs — stellate adjacency graphs. It is proved that a set of such graphs contains optimal secondary structures, i. e. adjacency graphs with a minimal diameter. There has been presented an algorithm for synthesizing this set. There has been suggested a method to accelerate synthesis of the optimal secondary structure of an algebraic Bayesian network.