Results 1 to 10 of about 173,504,166 (216)

Polynomial-Time Derivation of Optimal $k$-Tree Topology from Markov Networks

open access: yesJournal of Graph Algorithms and Applications
Characterization of joint probability distribution for large networks of random variables remains a challenging task in data science. Probabilistic graph approximation with simple topologies has practically been resorted to; typically the tree topology ...
Fereshteh R. Dastjerdi, Liming Cai
doaj   +1 more source

Structural Characterizations and Algebraic Realizations of a Family of Regular Integral Graphs

open access: yes
All the eigenvalues of an integral graphs are integers. Integral graphs are extremely rare. They form an asymptotically vanishing fraction $2^{-Ω(n)}$ among all graphs on $n$ vertices. It makes the construction of a new family of integral graphs a challenging task.
Manna, Tapa   +2 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy