A note on perfect Gaussian elimination

DOI10.1016/0022-247X(78)90053-7MaRDI QIDQ1246439zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

• A characterisation of rigid circuit graphs
• Comparability graphs and a new matroid
• scientific article; zbMATH DE number 3400923 (Why is no real title available?)
• Incidence matrices and interval graphs
• On rigid circuit graphs
• Perfect Elimination and Chordal Bipartite Graphs
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Toward Characterization of Perfect Elimination Digraphs
• Triangulated graphs and the elimination process

Cited in

(3)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1246439)