Remarks on implementation of O ( n 1/2 τ) assignment algorithms

DOI10.1145/44128.44131zbMath0648.65041OpenAlexW1968360394MaRDI QIDQ3793631

Torbjörn Wiberg, Iain S. Duff

Publication date: 1988

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: http://www.acm.org/pubs/contents/journals/toms/1988-14/

zbMATH Keywords

graph theorysparse matricessparse systemsbreadth first searchmarriage problemdepth first searchmaximum transversaltransversal algorithmsBlock triangularizationmaximum assignmentzero-free diagonal

Mathematics Subject Classification ID

Related Items (5)

Some issues in solving large sparse systems of equations ⋮ A hierarchical algorithm for making sparse matrices sparser ⋮ A survey of direct methods for sparse linear systems ⋮ Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems ⋮ Predicting the structure of sparse orthogonal factors

This page was built for publication: Remarks on implementation of O ( n ^1/2 τ) assignment algorithms