The General Minimum Fill-In Problem (Q3802913): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the theory of the elimination process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonserial dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5532570 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network Flow and Testing Graph Connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nested Dissection of a Regular Finite Element Mesh / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Automatic Nested Dissection Algorithm for Irregular Finite Element Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Automatic One-Way Dissection Algorithm for Irregular Finite Element Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of large sparse systems by ordered triangular factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Use of Linear Graphs in Gauss Elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5683627 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Aspects of Vertex Elimination on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3880236 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Minimum Fill-In is NP-Complete / rank
 
Normal rank

Latest revision as of 18:14, 18 June 2024

scientific article
Language Label Description Also known as
English
The General Minimum Fill-In Problem
scientific article

    Statements

    The General Minimum Fill-In Problem (English)
    0 references
    0 references
    1987
    0 references
    minimum fill-in problem
    0 references
    optimal ordering
    0 references
    sparse linear equations
    0 references
    separating set
    0 references
    tearing a graph
    0 references
    graph-theoretical elimination process
    0 references
    Gaussian elimination
    0 references
    system of linear equations
    0 references
    Initial Theorem
    0 references
    separation approach
    0 references
    load-flow calculation
    0 references

    Identifiers

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