scientific article; zbMATH DE number 1305489
From MaRDI portal
Publication:4252378
Recommendations
- scientific article; zbMATH DE number 1947421
- A wide-range algorithm for minimal triangulation from an arbitrary ordering
- Fast minimal triangulation algorithm using minimum degree criterion
- An algorithm for constructing locally optimal min-max triangulation
- An optimal algorithm for finding minimal enclosing triangles
- An exact algorithm for the minimum dilation triangulation problem
- Approximating minimum-weight triangulations in three dimensions
- A quasi-polynomial time approximation scheme for minimum weight triangulation
- A quasi-polynomial time approximation scheme for minimum weight triangulation
Cited in
(30)- Lex M versus MCS-M
- An exact algorithm for constructing minimum Euclidean skeletons of polygons
- Objective Bayesian Nets for Integrating Consistent Datasets
- A wide-range algorithm for minimal triangulation from an arbitrary ordering
- Representing a concept lattice by a graph
- Minimum Average Distance Triangulations
- A vertex incremental approach for maintaining chordality
- Minimal fill in O(\(n^{2.69}\)) time
- Implementation of linear minimum area enclosing triangle algorithm. Application note
- Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs
- Minimal triangulations of graphs: a survey
- Fast minimal triangulation algorithm using minimum degree criterion
- Maximal sub-triangulation in pre-processing phylogenetic data
- Solutions to the Minimum Variance Problem Using Delaunay Triangulation
- Maximum cardinality search for computing minimal triangulations of graphs
- An algorithm for constructing locally optimal min-max triangulation
- Computing and listing avoidable vertices and paths
- Algorithms for unipolar and generalized split graphs
- Computing minimal triangulations in time \(O(n^{\alpha \log n}) = o(n^{2.376})\)
- Treewidth computations. I: Upper bounds
- scientific article; zbMATH DE number 1953077 (Why is no real title available?)
- Sequential and parallel triangulating algorithms for elimination game and new insights on minimum degree
- scientific article; zbMATH DE number 7310078 (Why is no real title available?)
- Efficiently enumerating minimal triangulations
- Generating weakly chordal graphs from arbitrary graphs
- Computing and listing avoidable vertices and paths
- A heuristic triangulation algorithm
- Hybrid backtracking bounded by tree-decomposition of constraint networks
- A note on minimal d-separation trees for structural learning
- Two characterisations of the minimal triangulations of permutation graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4252378)
