The following pages link to (Q4252378):
Displaying 15 items.
- Two characterisations of the minimal triangulations of permutation graphs (Q390311) (← links)
- Algorithms for unipolar and generalized split graphs (Q741738) (← links)
- Hybrid backtracking bounded by tree-decomposition of constraint networks (Q814455) (← links)
- Minimal triangulations of graphs: a survey (Q819823) (← links)
- A vertex incremental approach for maintaining chordality (Q819824) (← links)
- Minimal fill in O(\(n^{2.69}\)) time (Q819828) (← links)
- Lex M versus MCS-M (Q819832) (← links)
- Treewidth computations. I: Upper bounds (Q964001) (← links)
- A note on minimal d-separation trees for structural learning (Q969533) (← links)
- Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs (Q1763474) (← links)
- Representing a concept lattice by a graph (Q1885806) (← links)
- Maximal sub-triangulation in pre-processing phylogenetic data (Q2500753) (← links)
- Objective Bayesian Nets for Integrating Consistent Datasets (Q5094018) (← links)
- (Q5150424) (← links)
- Computing and listing avoidable vertices and paths (Q6185944) (← links)
