Detection of structural inconsistency in systems of equations with degrees of freedom and its applications

DOI10.1016/0166-218X(85)90051-4zbMath0572.65050OpenAlexW2021394402MaRDI QIDQ1062429

Kōkichi Sugihara

Publication date: 1985

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

Full work available at URL: https://doi.org/10.1016/0166-218x(85)90051-4

zbMATH Keywords

large-scale systemsmatroidstructural inconsistency

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Graph theory (including graph drawing) in computer science (68R10) Graph theory (05C99) Applications of graph theory to circuits and networks (94C15)

Related Items

A characterisation of the generic rigidity of 2-dimensional point-line frameworks, Computer-Aided Creation of Impossible Objects and Impossible Motions, Structural solvability of systems of equations —A mathematical formulation for distinguishing accurate and inaccurate numbers in structural analysis of systems—, Design of solids for antigravity motion illusion, A rooted-forest partition with uniform vertex demand, Decomposition plans for geometric constraint systems. I: Performance measures for CAD, Rooted \(k\)-connections in digraphs, An algebraic and combinatorial approach to the analysis of line drawings of polyhedra

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A unifying approach to descriptive geometry and mechanisms
• The rigidity of graphs. II
• Network flow, transportation and scheduling. Theory and algorithms
• Transversal theory. An account of some aspects of combinatorial mathematics
• On graphs and rigidity of plane skeletal structures
• Coverings of Bipartite Graphs
• On Some Problems in the Design of Plane Skeletal Structures
• On Generic Rigidity in the Plane
• On Representatives of Subsets
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs