A note on perfect Gaussian elimination

DOI10.1016/0022-247X(78)90053-7zbMath0378.05049OpenAlexW2085268434MaRDI QIDQ1246439

Martin Charles Golumbic

Publication date: 1978

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-247x(78)90053-7

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Graph theory (05C99)

Related Items (3)

Algorithmic aspects of intersection graphs and representation hypergraphs ⋮ The elimination procedure for the competition number is not optimal ⋮ A remark on perfect Gaussian elimination of symmetric matrices

Cites Work

• Unnamed Item
• On rigid circuit graphs
• Comparability graphs and a new matroid
• A characterisation of rigid circuit graphs
• Incidence matrices and interval graphs
• Triangulated graphs and the elimination process
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Perfect Elimination and Chordal Bipartite Graphs
• Toward Characterization of Perfect Elimination Digraphs

This page was built for publication: A note on perfect Gaussian elimination