Bipartite graphs and an optimal bordered triangular form of a matrix

DOI10.1109/TCS.1979.1084574zbMath0416.68040OpenAlexW2106989837MaRDI QIDQ3206315

Theodore A. Bickart, Alberto L. Sangiovanni-Vincentelli

Publication date: 1979

Published in: IEEE Transactions on Circuits and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tcs.1979.1084574

zbMATH Keywords

computational complexitybipartite graphsdetermining row and column permutationsminimum essential dumbbell setoptimal bordered triangular form of a matrix

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Applications of graph theory to circuits and networks (94C15)

Related Items (1)

A degeneracy exploiting LU factorization for the simplex method

This page was built for publication: Bipartite graphs and an optimal bordered triangular form of a matrix