scientific article
From MaRDI portal
Publication:3828016
zbMath0674.05021MaRDI QIDQ3828016
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (17)
Long paths and toughness of \(k\)-trees and chordal planar graphs ⋮ Efficient learning of Bayesian networks with bounded tree-width ⋮ Learning Bounded Tree-Width Bayesian Networks via Sampling ⋮ Wiener indices of maximal \(k\)-degenerate graphs ⋮ Structure of wheel-trees with colourings and domination numbers ⋮ Sphere representations, stacked polytopes, and the Colin de Verdière number of a graph ⋮ Edge-intersection graphs of grid paths: the bend-number ⋮ Unnamed Item ⋮ Equitable list tree-coloring of bounded treewidth graphs ⋮ Characterizations of H-graphs ⋮ Approximate structure learning for large Bayesian networks ⋮ Efficient learning of bounded-treewidth Bayesian networks from complete and incomplete data sets ⋮ Convex dominating sets in maximal outerplanar graphs ⋮ On zero-sum spanning trees and zero-sum connectivity ⋮ \(k\)-Wiener index of a \(k\)-plex ⋮ Finding a Maximum-Weight Convex Set in a Chordal Graph ⋮ The square of a chordal graph
This page was built for publication:
