A clique tree algorithm for partitioning a chordal graph into transitive subgraphs (Q1894513)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A clique tree algorithm for partitioning a chordal graph into transitive subgraphs |
scientific article; zbMATH DE number 778274
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A clique tree algorithm for partitioning a chordal graph into transitive subgraphs |
scientific article; zbMATH DE number 778274 |
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
0 references
0 references
0 references
0.90615416
0 references
0.9022774
0 references
0.9017271
0 references
0.9017271
0 references
0.8991389
0 references
0.89062333
0 references
0 references
