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
Added link to MaRDI item. |
Created claim: DBLP publication ID (P1635): journals/siamcomp/TarjanY84, #quickstatements; #temporary_batch_1739530294150 |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Robert Endre Tarjan / rank | |||
Property / author | |||
Property / author: Robert Endre Tarjan / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1137/0213035 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1991477862 / rank | |||
Normal rank | |||
Property / DBLP publication ID | |||
Property / DBLP publication ID: journals/siamcomp/TarjanY84 / rank | |||
Normal rank |
Latest revision as of 12:54, 14 February 2025
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