An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph (Q1341730): Difference between revisions

@@ Property / cites work @@
+A taxonomy of problems with fast parallel algorithms
+Normal rank
@@ Property / cites work @@
+Matching and multidimensional matching in chordal and strongly chordal graphs
+Normal rank
@@ Property / cites work @@
+Q3804207
@@ Property / cites work: Q3804207 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3138901
@@ Property / cites work: Q3138901 / rank @@
+Normal rank
@@ Property / cites work @@
+Simplicial decompositions of graphs - some uniqueness results
+Normal rank
@@ Property / cites work @@
+On rigid circuit graphs
@@ Property / cites work: On rigid circuit graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Chordal graph recognition is in NC
@@ Property / cites work: Chordal graph recognition is in NC / rank @@
+Normal rank
@@ Property / cites work @@
+Parallelism in random access machines
@@ Property / cites work: Parallelism in random access machines / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
+Normal rank
@@ Property / cites work @@
+The intersection graphs of subtrees in trees are exactly the chordal graphs
+Normal rank
@@ Property / cites work @@
+An improved parallel algorithm that computes the BFS numbering of a directed graph
+Normal rank
@@ Property / cites work @@
+Q3806672
@@ Property / cites work: Q3806672 / rank @@
+Normal rank
@@ Property / cites work @@
+A Separator Theorem for Chordal Graphs
@@ Property / cites work: A Separator Theorem for Chordal Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient parallel algorithms for finding maximal cliques, clique trees, and minimum coloring on chordal graphs
+Normal rank
@@ Property / cites work @@
+Q4385522
@@ Property / cites work: Q4385522 / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel Prefix Computation
@@ Property / cites work: Parallel Prefix Computation / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Parallel Algorithms for Chordal Graphs
@@ Property / cites work: Fast Parallel Algorithms for Chordal Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Minimal triangulation of a graph and optimal pivoting order in a sparse matrix
+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 @@
+Algorithmic Aspects of Vertex Elimination on Graphs
+Normal rank
@@ Property / cites work @@
+Q4172915
@@ Property / cites work: Q4172915 / 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 @@
+Decomposition by clique separators
@@ Property / cites work: Decomposition by clique separators / rank @@
+Normal rank
@@ Property / cites work @@
+An Efficient Parallel Biconnectivity Algorithm
@@ Property / cites work: An Efficient Parallel Biconnectivity Algorithm / rank @@
+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 @@
+Addendum: 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