An algorithm for identifying Morishima and anti-Morishima matrices and balanced digraphs (Q1059646)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3904626
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm for identifying Morishima and anti-Morishima matrices and balanced digraphs |
scientific article; zbMATH DE number 3904626 |
Statements
An algorithm for identifying Morishima and anti-Morishima matrices and balanced digraphs (English)
0 references
1983
0 references
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.
0 references
balanced graphs
0 references
signed digraphs
0 references
anti-Morishima matrices
0 references
signed graph
0 references
depth first
0 references
0.776309072971344
0 references
0.7550520896911621
0 references
0.7477260231971741
0 references
0.7328518033027649
0 references
0.7238600254058838
0 references
