The parallel complexity of elimination ordering procedures
From MaRDI portal
Publication:6143979
Recommendations
- Efficient Parallel Algorithms for Chordal Graphs
- On the semi-perfect elimination
- Fast Parallel Algorithms for Chordal Graphs
- Counting clique trees and computing perfect elimination schemes in parallel
- Parallel computation of perfect elimination schemes using partition techniques on triangulated graphs
Cites work
- scientific article; zbMATH DE number 3891425 (Why is no real title available?)
- scientific article; zbMATH DE number 43583 (Why is no real title available?)
- A taxonomy of problems with fast parallel algorithms
- Addendum: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Algorithmic Aspects of Vertex Elimination on Graphs
- An Efficient Parallel Biconnectivity Algorithm
- An O(logn) parallel connectivity algorithm
- An upper bound for the chromatic number of a graph and its application to timetabling problems
- Characterizations of strongly chordal graphs
- Constructing a Maximal Independent Set in Parallel
- Doubly Lexical Orderings of Matrices
- Doubly lexical ordering of dense 0--1 matrices
- Four classes of perfectly orderable graphs
- Incidence matrices and interval graphs
- On the complexity of recognizing perfectly orderable graphs
- On the semi-perfect elimination
- The lexicographically first maximal subgraph problems:P-completeness andNC algorithms
- Three Partition Refinement Algorithms
- Triangulated graphs and the elimination process
This page was built for publication: The parallel complexity of elimination ordering procedures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6143979)
