An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph
type: Item
instance of: scholarly article
title: An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph
zbMATH Open document ID: 0938.68958
DOI: 10.1016/0304-3975(94)90250-X
author: Elias Dahlhaus
author: Marek Karpinski
published in: Theoretical Computer Science
publication date: 2000-06-15T00:00:00Z
Mathematics Subject Classification ID: 68W10
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 708711
MaRDI profile type: Publication
cites work: A taxonomy of problems with fast parallel algorithms
cites work: Matching and multidimensional matching in chordal and strongly chordal graphs
cites work: Q3804207
cites work: Q3138901
cites work: Simplicial decompositions of graphs - some uniqueness results
cites work: On rigid circuit graphs
cites work: Chordal graph recognition is in NC
cites work: Parallelism in random access machines
cites work: Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs
cites work: An improved parallel algorithm that computes the BFS numbering of a directed graph
cites work: Q3806672
cites work: A Separator Theorem for Chordal Graphs
cites work: Q3328583
cites work: Efficient parallel algorithms for finding maximal cliques, clique trees, and minimum coloring on chordal graphs
cites work: Q4385522
cites work: Parallel Prefix Computation
cites work: Fast Parallel Algorithms for Chordal Graphs
cites work: Minimal triangulation of a graph and optimal pivoting order in a sparse matrix
cites work: Triangulated graphs and the elimination process
cites work: Algorithmic Aspects of Vertex Elimination on Graphs
cites work: Q4172915
cites work: An O(logn) parallel connectivity algorithm
cites work: Decomposition by clique separators
cites work: An Efficient Parallel Biconnectivity Algorithm
cites work: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
cites work: Addendum: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
cites work: Computing the Minimum Fill-In is NP-Complete
description: scientific article; zbMATH DE number 708711