A clique tree algorithm for partitioning a chordal graph into transitive subgraphs (Q1894513): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 13:22, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A clique tree algorithm for partitioning a chordal graph into transitive subgraphs |
scientific article |
Statements
A clique tree algorithm for partitioning a chordal graph into transitive subgraphs (English)
0 references
6 September 1995
0 references
The authors improve their linear time greedy algorithm presented in [Partitioning a chordal graph into transitive subgraphs for parallel sparse triangular solution, Linear Algebra Appl. 192, 329-353 (1993; Zbl 0786.05081)].
0 references
clique tree algorithm
0 references
chordal graph
0 references
parallel sparse triangular solution
0 references
chordal graph elimination ordering
0 references
linear time greedy algorithm
0 references
