The following pages link to (Q4252378):
Displaying 28 items.
- Two characterisations of the minimal triangulations of permutation graphs (Q390311) (← links)
- Fast minimal triangulation algorithm using minimum degree criterion (Q551209) (← 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)
- Maximum cardinality search for computing minimal triangulations of graphs (Q1882406) (← links)
- Representing a concept lattice by a graph (Q1885806) (← links)
- Efficiently enumerating minimal triangulations (Q1983135) (← links)
- Implementation of linear minimum area enclosing triangle algorithm. Application note (Q2013616) (← links)
- An exact algorithm for constructing minimum Euclidean skeletons of polygons (Q2131144) (← links)
- Sequential and parallel triangulating algorithms for elimination game and new insights on minimum degree (Q2378540) (← links)
- Maximal sub-triangulation in pre-processing phylogenetic data (Q2500753) (← links)
- Minimum Average Distance Triangulations (Q2912886) (← links)
- Computing minimal triangulations in time \(O(n^{\alpha \log n}) = o(n^{2.376})\) (Q2921757) (← links)
- A heuristic triangulation algorithm (Q3776650) (← links)
- An algorithm for constructing locally optimal min-max triangulation (Q4346968) (← links)
- (Q4414480) (← links)
- Objective Bayesian Nets for Integrating Consistent Datasets (Q5094018) (← links)
- Solutions to the Minimum Variance Problem Using Delaunay Triangulation (Q5139666) (← links)
- (Q5150424) (← links)
- A wide-range algorithm for minimal triangulation from an arbitrary ordering (Q5468869) (← links)
- Computing and listing avoidable vertices and paths (Q6185944) (← links)
