A note on perfect Gaussian elimination

DOI10.1016/0022-247X(78)90053-7zbMATH Open0378.05049OpenAlexW2085268434MaRDI QIDQ1246439FDOQ1246439

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

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

Cites Work

• Incidence matrices and interval graphs
• On rigid circuit graphs
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Triangulated graphs and the elimination process
• Comparability graphs and a new matroid
• Perfect Elimination and Chordal Bipartite Graphs
• Title not available (Why is that?)
• A characterisation of rigid circuit graphs
• Toward Characterization of Perfect Elimination Digraphs

Cited In (3)

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

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)