scientific article; zbMATH DE number 1953077
From MaRDI portal
Publication:4414480
Recommendations
- Maximum cardinality search for computing minimal triangulations of graphs
- Efficiently enumerating minimal triangulations
- Computing MaxMin edge length triangulations
- Computing MaxMin edge length triangulations
- Approximating the maxmin-angle covering triangulation
- Triangulating planar graphs while minimizing the maximum degree
- Triangulating planar graphs while minimizing the maximum degree
- Finding triangles for maximum planar subgraphs
- A wide-range algorithm for minimal triangulation from an arbitrary ordering
- scientific article; zbMATH DE number 1305489
Cited in
(14)- Maximum cardinality search for computing minimal triangulations of graphs
- Graph-Theoretic Concepts in Computer Science
- Space-efficient algorithms for maximum cardinality search, its applications, and variants of BFS
- Computing a clique tree with the algorithm maximal label search
- Triangulating planar graphs while minimizing the maximum degree
- Tree decompositions and social graphs
- Lex M versus MCS-M
- Treewidth computations. I: Upper bounds
- Maximal sub-triangulation in pre-processing phylogenetic data
- Efficiently enumerating minimal triangulations
- Differential geometric treewidth estimation in adiabatic quantum computation
- Maximal label search algorithms to compute perfect and minimal elimination orderings
- Space-efficient algorithms for maximum cardinality search, stack BFS, queue BFS and applications
- Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability 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 Q4414480)
