Recognizing sign solvable graphs

DOI10.1016/0166-218X(83)90079-3MaRDI QIDQ585223zbMATH OpenWikidataFDO

Authors Pierre Hansen

Publication date 1983

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-218X(83)90079-3

zbMATH Keywords

qualitative linear systemssign solvable graphssigned graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph theory (including graph drawing) in computer science (68R10) Mathematical economics (91B99)

Cites work

• A New Method of Checking the Consistency of Precedence Matrices
• Depth-First Search and Linear Graph Algorithms
• Graph-theoretical approach to qualitative solvability of linear systems
• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• scientific article; zbMATH DE number 3048439 (Why is no real title available?)
• Qualitative Economics and the Scope of the Correspondence Principle
• Sign solvable graphs

Cited in

(9)

• Recursive structure of S-matrices and an O(m^ 2) algorithm for recognizing sign solvability
• A qualitative analysis of x=Ax+b
• On the recognition of \(S\)-systems
• Qualitative comparative statics
• Detecting stable matrices
• On the digraphs of sign solvable linear systems
• Graph-theoretical approach to qualitative solvability of linear systems
• Robust economic models
• Signsolvability revisited

This page was built for publication: Recognizing sign solvable graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q585223)