Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs (Q3335007)

From MaRDI portal
Revision as of 21:46, 19 February 2024 by RedirectionBot (talk | contribs) (‎Changed an Item)
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