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
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Robert Endre Tarjan / rank
Normal rank
 
Property / author
 
Property / author: Robert Endre Tarjan / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q90315968 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:37, 20 March 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
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references