A fast algorithm for solving systems of linear equations with two variables per equation

DOI10.1016/0024-3795(80)90162-7zbMath0453.65011OpenAlexW2060354186WikidataQ126844125 ScholiaQ126844125MaRDI QIDQ1149227

Bengt Aspvall, Yossi Shiloach

Publication date: 1980

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(80)90162-7

zbMATH Keywords

undirected graphtwo variables per equation

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (4)

Quasi-Linear-Time Algorithms by Generalisation of Union-Find in CHR ⋮ A faster algorithm for determining the linear feasibility of systems of BTVPI constraints ⋮ Linear-time version of Holub's algorithm for morphic imprimitivity testing ⋮ Integer programming with 2-variable equations and 1-variable inequalities

Cites Work

• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• The Use of Linear Graphs in Gauss Elimination
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A fast algorithm for solving systems of linear equations with two variables per equation