Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs (Q3335007)
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: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs |
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
