Predicting fill for sparse orthogonal factorization
Journal of the ACM (JACM)
Direct methods for sparse matrices
Direct methods for sparse matrices
Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Evaluation of orderings for unsymmetric sparse matrics
SIAM Journal on Scientific and Statistical Computing
Computing a sparse basis for the null space
SIAM Journal on Algebraic and Discrete Methods
Remarks on implementation of O(n1/2τ) assignment algorithms
ACM Transactions on Mathematical Software (TOMS)
A data structure for sparse QR and LU factorizations
SIAM Journal on Scientific and Statistical Computing - Telecommunication Programs at U.S. Universities
A parallel graph partitioning algorithm for a message-passing multiprocessor
International Journal of Parallel Programming
ACM Transactions on Mathematical Software (TOMS)
A graph partitioning algorithm by node separators
ACM Transactions on Mathematical Software (TOMS)
The null space problem II. Algorithms
SIAM Journal on Algebraic and Discrete Methods
Partitioning sparse matrices with eigenvectors of graphs
SIAM Journal on Matrix Analysis and Applications
An Implementation of Tarjan's Algorithm for the Block Triangularization of a Matrix
ACM Transactions on Mathematical Software (TOMS)
On Algorithms for Obtaining a Maximum Transversal
ACM Transactions on Mathematical Software (TOMS)
Computer Solution of Large Sparse Positive Definite
Computer Solution of Large Sparse Positive Definite
Orderings for Parallel Sparse Symmetric Factorization
Proceedings of the Third SIAM Conference on Parallel Processing for Scientific Computing
Sparse null bases and marriage theorems
Sparse null bases and marriage theorems
Matching Theory (North-Holland mathematics studies)
Matching Theory (North-Holland mathematics studies)
ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation
Sparse QR factorization in MATLAB
ACM Transactions on Mathematical Software (TOMS)
The design of MA48: a code for the direct solution of sparse unsymmetric linear systems of equations
ACM Transactions on Mathematical Software (TOMS)
Fast and effective algorithms for graph partitioning and sparse-matrix ordering
IBM Journal of Research and Development - Special issue: optical lithography I
A software package for sparse orthogonal factorization and updating
ACM Transactions on Mathematical Software (TOMS)
Using Graph Decomposition for Solving Continuous CSPs
CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
Nested-Dissection Orderings for Sparse LU with Partial Pivoting
NAA '00 Revised Papers from the Second International Conference on Numerical Analysis and Its Applications
Journal of Computer Science and Technology - Special section on China AVS standard
A partitioning algorithm for block-diagonal matrices with overlap
Parallel Computing
Mobility Model and Relay Management for Disaster Area Wireless Networks
WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
A protocol for decentralized multi-vehicle mapping with limited communication connectivity
ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
A Method for Sensor Placement Taking into Account Diagnosability Criteria
International Journal of Applied Mathematics and Computer Science - Issues in Fault Diagnosis and Fault Tolerant Control
VECPAR'06 Proceedings of the 7th international conference on High performance computing for computational science
Heuristics for a matrix symmetrization problem
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
On coverage and capacity for disaster area wireless networks using mobile relays
EURASIP Journal on Wireless Communications and Networking
Hierarchical Diagonal Blocking and Precision Reduction Applied to Combinatorial Multigrid
Proceedings of the 2010 ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis
On some current results of graph theory for ad-hoc networks
Journal of Mobile Multimedia
Using image depth information for fast face detection
TAROS'11 Proceedings of the 12th Annual conference on Towards autonomous robotic systems
Algorithm 915, SuiteSparseQR: Multifrontal multithreaded rank-revealing sparse QR factorization
ACM Transactions on Mathematical Software (TOMS)
Design, implementation, and analysis of maximum transversal algorithms
ACM Transactions on Mathematical Software (TOMS)
On bounded block decomposition problems for under-specified systems of equations
Journal of Computer and System Sciences
Computing maximum matching in parallel on bipartite graphs: worth the effort?
Proceedings of the first workshop on Irregular applications: architectures and algorithm
Partitioning Hypergraphs in Scientific Computing Applications through Vertex Separators on Graphs
SIAM Journal on Scientific Computing
Approximate weighted matching on emerging manycore and multithreaded architectures
International Journal of High Performance Computing Applications
Push-relabel based algorithms for the maximum transversal problem
Computers and Operations Research
Video key frame extraction through dynamic Delaunay clustering with a structural constraint
Journal of Visual Communication and Image Representation
Coordinate-free geometry and decomposition in geometrical constraint solving
Computer-Aided Design
| Hi-index | 0.00 |
We consider the problem of permuting the rows and columns of a rectangular or square, unsymmetric sparse matrix to compute its block triangular form. This block triangular form is based on a canonical decomposition of bipartite graphs induced by a maximum matching and was discovered by Dulmage and Mendelsohn. We describe implementations of algorithms to compute the block triangular form and provide computational results on sparse matrices from test collections. Several applications of the block triangular form are also included.