The following pages link to (Q3828016):
Displaying 16 items.
- Approximate structure learning for large Bayesian networks (Q146611) (← links)
- Efficient learning of bounded-treewidth Bayesian networks from complete and incomplete data sets (Q146614) (← links)
- Sphere representations, stacked polytopes, and the Colin de Verdière number of a graph (Q907257) (← links)
- The square of a chordal graph (Q1322181) (← links)
- Long paths and toughness of \(k\)-trees and chordal planar graphs (Q1618219) (← links)
- On zero-sum spanning trees and zero-sum connectivity (Q2073300) (← links)
- \(k\)-Wiener index of a \(k\)-plex (Q2075457) (← links)
- Equitable list tree-coloring of bounded treewidth graphs (Q2220879) (← links)
- Convex dominating sets in maximal outerplanar graphs (Q2312656) (← links)
- Efficient learning of Bayesian networks with bounded tree-width (Q2374540) (← links)
- Structure of wheel-trees with colourings and domination numbers (Q2413362) (← links)
- Edge-intersection graphs of grid paths: the bend-number (Q2440108) (← links)
- Wiener indices of maximal \(k\)-degenerate graphs (Q2657107) (← links)
- Characterizations of H-graphs (Q2795961) (← links)
- Finding a Maximum-Weight Convex Set in a Chordal Graph (Q3121516) (← links)
- Learning Bounded Tree-Width Bayesian Networks via Sampling (Q3451198) (← links)
