Fast minimal triangulation algorithm using minimum degree criterion (Q551209): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2011.04.022
@@ Property / DOI: 10.1016/j.tcs.2011.04.022 / rank @@
-Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C85
@@ Property / Mathematics Subject Classification ID: 05C85 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C70
@@ Property / Mathematics Subject Classification ID: 05C70 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+5920452
@@ Property / zbMATH DE Number: 5920452 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+minimal triangulations
@@ Property / zbMATH Keywords: minimal triangulations / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+chordal graphs
@@ Property / zbMATH Keywords: chordal graphs / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+minimum degree
@@ Property / zbMATH Keywords: minimum degree / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2011.04.022
+Normal rank
@@ Property / OpenAlex ID @@
+W2002740543
@@ Property / OpenAlex ID: W2002740543 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Desirability of Acyclic Database Schemes
@@ Property / cites work: On the Desirability of Acyclic Database Schemes / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum cardinality search for computing minimal triangulations of graphs
+Normal rank
@@ Property / cites work @@
+A wide-range algorithm for minimal triangulation from an arbitrary ordering
+Normal rank
@@ Property / cites work @@
+Sequential and parallel triangulating algorithms for elimination game and new insights on minimum degree
+Normal rank
@@ Property / cites work @@
+Graph-Theoretic Concepts in Computer Science
@@ Property / cites work: Graph-Theoretic Concepts in Computer Science / rank @@
+Normal rank
@@ Property / cites work @@
+A practical algorithm for making filled graphs minimal
+Normal rank
@@ Property / cites work @@
+Q4288578
@@ Property / cites work: Q4288578 / rank @@
+Normal rank
@@ Property / cites work @@
+Convexity in Graphs and Hypergraphs
@@ Property / cites work: Convexity in Graphs and Hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+The Evolution of the Minimum Degree Ordering Algorithm
+Normal rank
@@ Property / cites work @@
+Minimal triangulations of graphs: a survey
@@ Property / cites work: Minimal triangulations of graphs: a survey / rank @@
+Normal rank
@@ Property / cites work @@
+Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions
+Normal rank
@@ Property / cites work @@
+Computing Minimal Triangulations in Time O(nalpha log n) = o(n2.376)
+Normal rank
@@ Property / cites work @@
+Fully dynamic algorithms for chordal graphs and split graphs
+Normal rank
@@ Property / cites work @@
+Representation of a finite graph by a set of intervals on the real line
+Normal rank
@@ Property / cites work @@
+Simple algorithms for minimal triangulation of a graph and backward selection of a decomposable Markov network
+Normal rank
@@ Property / cites work @@
+Characterizations and algorithmic applications of chordal graph embeddings
+Normal rank
@@ Property / cites work @@
+Algorithmic Aspects of Vertex Elimination on Graphs
+Normal rank
@@ Property / cites work @@
+Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
+Normal rank
@@ Property / cites work @@
+Computing the Minimum Fill-In is NP-Complete
@@ Property / cites work: Computing the Minimum Fill-In is NP-Complete / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2011.04.022
@@ Property / DOI: 10.1016/J.TCS.2011.04.022 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:551209