Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs (Q3335007): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q90315968, #quickstatements; #temporary_batch_1705852562737 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 13:47, 4 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs |
scientific article |
Statements
Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs (English)
0 references
1984
0 references
graph algorithm
0 references
acyclic data base scheme
0 references
sparse Gaussian elimination
0 references
graph search
0 references
Chordal graphs
0 references
acyclic hypergraphs
0 references
