The parallel complexity of elimination ordering procedures
From MaRDI portal
Publication:6143979
DOI10.1007/3-540-57899-4_55zbMATH Open1528.68284OpenAlexW1799517289MaRDI QIDQ6143979FDOQ6143979
Authors: Elias Dahlhaus 
Publication date: 5 January 2024
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-57899-4_55
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
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)
Cites Work
- Incidence matrices and interval graphs
- A taxonomy of problems with fast parallel algorithms
- Doubly lexical ordering of dense 0--1 matrices
- Three Partition Refinement Algorithms
- Characterizations of strongly chordal graphs
- Triangulated graphs and the elimination process
- An upper bound for the chromatic number of a graph and its application to timetabling problems
- Title not available (Why is that?)
- Algorithmic Aspects of Vertex Elimination on Graphs
- An Efficient Parallel Biconnectivity Algorithm
- Doubly Lexical Orderings of Matrices
- Four classes of perfectly orderable graphs
- Title not available (Why is that?)
- On the complexity of recognizing perfectly orderable graphs
- On the semi-perfect elimination
- An O(logn) parallel connectivity algorithm
- Addendum: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- The lexicographically first maximal subgraph problems:P-completeness andNC algorithms
- Constructing a Maximal Independent Set in Parallel
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)
