scientific article; zbMATH DE number 1264490

MaRDI QIDQ4233448zbMATH OpenFDO

Authors I. Ponzoni, M. C. Sánchez, N. B. Brignole

Publication date 18 March 1999

Full work available at URL https://eudml.org/doc/225659, http://www.emis.de/journals/SADIO/vol.1.1/

zbMATH Keywords

graph theorydirected graphsbipartite graphspartitioning algorithmsTarjan's algorithmassignment algorithmsblock lower-triangular forms

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Permuting Sparse Rectangular Matrices into Block-Diagonal Form
• Computing the block triangular form of a sparse matrix
• A recursive bipartitioning algorithm for permuting sparse square matrices into block diagonal form with overlap
• On algorithms for permuting large entries to the diagonal of a sparse matrix

Cited in

(3)

• Counting solutions to binomial complete intersections
• A recursive bipartitioning algorithm for permuting sparse square matrices into block diagonal form with overlap
• The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices

This page was built for publication:

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