Sequential and parallel triangulating algorithms for elimination game and new insights on minimum degree (Q2378540): Difference between revisions

@@ Property / author @@
-Elias Dahlhaus
@@ Property / author: Elias Dahlhaus / rank @@
-Normal rank
@@ Property / author @@
+Elias Dahlhaus
@@ Property / author: Elias Dahlhaus / 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.2008.09.059
+Normal rank
@@ Property / OpenAlex ID @@
+W1988291464
@@ Property / OpenAlex ID: W1988291464 / rank @@
+Normal rank
@@ Property / cites work @@
+An Approximate Minimum Degree Ordering Algorithm
@@ Property / cites work: An Approximate Minimum Degree Ordering Algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum cardinality search for computing minimal triangulations of graphs
+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 @@
+Parallel Merge Sort
@@ Property / cites work: Parallel Merge Sort / rank @@
+Normal rank
@@ Property / cites work @@
+Q4373676
@@ Property / cites work: Q4373676 / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition
+Normal rank
@@ Property / cites work @@
+An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph
+Normal rank
@@ Property / cites work @@
+On rigid circuit graphs
@@ Property / cites work: On rigid circuit graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Incidence matrices and interval graphs
@@ Property / cites work: Incidence matrices and interval graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The Evolution of the Minimum Degree Ordering Algorithm
+Normal rank
@@ Property / cites work @@
+On treewidth and minimum fill-in of asteroidal triple-free 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 @@
+The Elimination form of the Inverse and its Application to Linear Programming
+Normal rank
@@ Property / cites work @@
+Minimal triangulation of a graph and optimal pivoting order in a sparse matrix
+Normal rank
@@ Property / cites work @@
+Characterizations and algorithmic applications of chordal graph embeddings
+Normal rank
@@ Property / cites work @@
+The Use of Linear Graphs in Gauss Elimination
@@ Property / cites work: The Use of Linear Graphs in Gauss Elimination / rank @@
+Normal rank
@@ Property / cites work @@
+Minimal Orderings Revisited
@@ Property / cites work: Minimal Orderings Revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Triangulated graphs and the elimination process
@@ Property / cites work: Triangulated graphs and the elimination process / rank @@
+Normal rank
@@ Property / cites work @@
+Q5683627
@@ Property / cites work: Q5683627 / rank @@
+Normal rank
@@ Property / cites work @@
+An O(logn) parallel connectivity algorithm
@@ Property / cites work: An O(logn) parallel connectivity algorithm / rank @@
+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