Signsolvability revisited
From MaRDI portal
Publication:795898
DOI10.1016/0024-3795(84)90164-2zbMath0543.15016MaRDI QIDQ795898
Victor Klee, Rachel Manber, Richard E. Ladner
Publication date: 1984
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(84)90164-2
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
15B57: Hermitian, skew-Hermitian, and related matrices
Related Items
Ranks of zero patterns and sign patterns*, Sign-Solvable Cone-Systems, On maximal convertible matrices, On signed digraphs with all cycles negative, Robust economic models, Qualitatively invertible matrices, Computing the inertia from sign patterns, Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs, Sign-nonsingular matrices and even cycles in directed graphs, Even cycles in directed graphs, Characterization of even directed graphs, Regular and singular orthants of tridiagonal matrices, Recursive structure of S-matrices and an \(O(m^ 2)\) algorithm for recognizing sign solvability, A qualitative analysis of \(\dot x=Ax+b\), Combinatorial matrix analysis: An overview, A note on odd/even cycles, When the sign pattern of a square matrix determines uniquely the sign pattern of its inverse, The symbiotic relationship of combinatorics and matrix theory, Strong forms of nonsingularity, Nonsingularity criteria for matrices involving combinatorial considerations, On the recognition of \(S\)-systems, Rectangular \(L\)-matrices, Sign-central matrices, Blocking set free configurations and their relations to digraphs and hypergraphs, Ray patterns of matrices and nonsingularity, Mixed dominating matrices, Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets, Conditional \(S\)-matrices., On the hardness of efficiently approximating maximal non-\(L\) submatrices., Linear systems with signed solutions, On the digraphs of sign solvable linear systems, Strong orientations without even directed circuits, Nearly L-matrices and generalized row sign balanced matrices, Ray solvable linear systems and ray \(S^2 NS\) matrices, Conditional sign-solvability, Qualitative comparative statics and audits of model performance, On digraphs and forbidden configurations of strong sign nonsingular matrices, Special parity of perfect matchings in bipartite graphs, Graph-theoretical approach to qualitative solvability of linear systems, Set-systems with signed solutions, Nonsingular sign patterns and the orthogonal group, Polynomial recognition of equal unions in hypergraphs with few vertices of large degree, Sign-patterns which require a positive eigenvalue, L-Functions and Their Inverses, Substitutes and Complements in Constrained Linear Models, From qualitative matrices to quantitative restrictions, Qualitative stability and solvability of difference equations, The Even Cycle Problem for Directed Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Recognizing sign solvable graphs
- Even cycles in directed graphs
- The directed subgraph homeomorphism problem
- A simple algorithm to detect balance in signed graphs
- Graph-theoretical approach to qualitative solvability of linear systems
- The Structure of Qualitatively Determinate Relationships
- Cycles in digraphs– a survey
- ON THE TWO-COLOURING OF HYPERGRAPHS
- Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
- A search strategy for the elementary cycles of a directed graph
- Enumeration of the Elementary Circuits of a Directed Graph
- Finding All the Elementary Circuits of a Directed Graph
- The complexity of satisfiability problems
- Qualitative Problems in Matrix Theory
- Generalized Predator-Prey Oscillations in Ecological and Economic Equilibrium
- Qualitative Economics and the Scope of the Correspondence Principle
- The complexity of theorem-proving procedures
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
