An algorithm for identifying Morishima and anti-Morishima matrices and balanced digraphs
From MaRDI portal
We present an algorithm for identifying Morishima and anti-Morishima matrices. Since Morishima matrices have signed digraphs that are balanced, our algorithm also identifies such digraphs. We actually work with a signed graph and our algorithm is a depth first traversal with certain markers added to keep track of parsing of nodes and signs of edges. The algorithm is, of course, linear in the amount of input.
Recommendations
- A theorem concerning certain sign symmetric matrices whose inverses are Morishima
- Recognizing balanceable matrices
- Some results concerning invertible Morishima and anti-Morishima matrices whose associated digraphs are trees
- A polynomial recognition algorithm for balanced matrices
- Balanced \(0,\pm 1\) matrices. II: Recognition algorithm
Cites work
- A simple algorithm to detect balance in signed graphs
- Depth-First Search and Linear Graph Algorithms
- scientific article; zbMATH DE number 3226832 (Why is no real title available?)
- Mechanical vibration trees
- On the computational power of pushdown automata
- On the notion of balance of a signed graph
- Qualitative Problems in Matrix Theory
- Some Aspects of the Theory of PN-Matrices
Cited in
(6)- Some results concerning invertible Morishima and anti-Morishima matrices whose associated digraphs are trees
- A theorem concerning certain sign symmetric matrices whose inverses are Morishima
- The line index and minimum cut of weighted graphs
- Detecting stable matrices
- PFFM and Quasi-Morishima matrices
- Robust economic models
This page was built for publication: An algorithm for identifying Morishima and anti-Morishima matrices and balanced digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1059646)
