Graph theory and sparse matrix computation. Proceedings of a workshop that was an integral part of the 1991-92 IMA program on Applied linear algebra, Minneapolis, MN (USA)
From MaRDI portal
Publication:1310789
zbMath0785.00030MaRDI QIDQ1310789
No author found.
Publication date: 15 December 1993
Published in: The IMA Volumes in Mathematics and its Applications (Search for Journal in Brave)
Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to combinatorics (05-06) Proceedings, conferences, collections, etc. pertaining to numerical analysis (65-06)
Related Items (5)
A clique tree algorithm for partitioning a chordal graph into transitive subgraphs ⋮ Control of large-scale systems in a multiprocessor environment ⋮ Structural controllability of networked relative coupling systems ⋮ A new efficient algorithm for computing Gröbner bases \((F_4)\) ⋮ On the controllability and observability of networked dynamic systems
This page was built for publication: Graph theory and sparse matrix computation. Proceedings of a workshop that was an integral part of the 1991-92 IMA program on Applied linear algebra, Minneapolis, MN (USA)
