Optimum and suboptimum methods for permuting a matrix into bordered triangular form

DOI10.1016/0016-0032(80)90020-4zbMath0424.65014OpenAlexW1973176219MaRDI QIDQ1135085

Bharat Kinariwala, Kabekode V. S. Bhat

Publication date: 1980

Published in: Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0016-0032(80)90020-4

zbMATH Keywords

algorithmbordered triangular formdegree switching operationsdigraph of the matrixpermuting a matrix

Mathematics Subject Classification ID

Canonical forms, reductions, classification (15A21)

Related Items

Degree switching operations in networks and large scale systems assignment problems

Cites Work

• Unnamed Item
• Theory of Output Set Assignments and Degree Switching Operations
• On bordered triangular or lower N forms of an irreducible matrix
• Reducibility among Combinatorial Problems
• Depth-First Search and Linear Graph Algorithms
• Sparse matrices