Graph Theoretic Methods for the Qualitative Analysis of Rectangular Matrices
From MaRDI portal
Publication:3963046
DOI10.1137/0602025zbMath0498.05047OpenAlexW2010933578MaRDI QIDQ3963046
Harvey J. Greenberg, John S. Maybee, J. Richard Lundgren
Publication date: 1981
Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0602025
Related Items (12)
Inverting Signed Graphs ⋮ Unnamed Item ⋮ Extensions of graph inversion to support an artificially intelligent modeling environment ⋮ Robust economic models ⋮ Row and column orthogonal (0,1)-matrices ⋮ Rectangular Matrices and Signed Graphs ⋮ Determinacy in Linear Systems and Networks ⋮ Qualitative comparative statics and audits of model performance ⋮ Applications of edge coverings by cliques ⋮ A characterization of graphs of competition number m ⋮ Inverting graphs of rectangular matrices ⋮ Syntax-directed report writing in linear programming using ANALYZE
Uses Software
Cites Work
- Graph theory in modern engineering. Computer aided design, control, optimization, reliability analysis
- A new family of binary pseudorandom sequences having optimal periodic correlation properties and larger linear span
- The connectivity function of a graph
- Row-column permutation of sparse matrices
- Qualitative Problems in Matrix Theory
- Rearranging Matrices to Block-Angular form for Decomposition (And Other) Algorithms
- THE MAXIMUM CONNECTIVITY OF A GRAPH
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Graph Theoretic Methods for the Qualitative Analysis of Rectangular Matrices