The General Minimum Fill-In Problem

DOI10.1137/0608059zbMath0655.90089OpenAlexW2070778341MaRDI QIDQ3802913

Horst Wendel

Publication date: 1987

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0608059

zbMATH Keywords

Gaussian eliminationseparating setsystem of linear equationsoptimal orderingsparse linear equationsminimum fill-in problemgraph-theoretical elimination processInitial Theoremload-flow calculationseparation approachtearing a graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Graph theory (05C99) Direct numerical methods for linear systems and matrix inversion (65F05) Linear equations (linear algebraic aspects) (15A06)

Related Items

Asymptotic constants in averaged Hölder inequalities

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the theory of the elimination process
• Nonserial dynamic programming
• The Use of Linear Graphs in Gauss Elimination
• An Automatic One-Way Dissection Algorithm for Irregular Finite Element Problems
• Computing the Minimum Fill-In is NP-Complete
• Network Flow and Testing Graph Connectivity
• Algorithmic Aspects of Vertex Elimination on Graphs
• An Automatic Nested Dissection Algorithm for Irregular Finite Element Problems
• Solution of large sparse systems by ordered triangular factorization
• Nested Dissection of a Regular Finite Element Mesh