scientific article
From MaRDI portal
Publication:4000391
zbMath0729.05012MaRDI QIDQ4000391
Publication date: 18 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Combinatorial aspects of matroids and geometric lattices (05B35) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25) Applications of graph theory to circuits and networks (94C15) Statics (70C20) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01)
Related Items
Max-balanced flows in oriented matroids, Colorability of induced matroids, Combinatorial relaxation algorithm for the maximum degree of subdeterminants: Computing Smith-McMillan form at infinity and structural indices in Kronecker form, Index minimization of differential-algebraic equations in hybrid analysis for circuit simulation, A port-Hamiltonian formulation of physical switching systems with varying constraints, On the quasi-transversals of a matroid, Principal structure of submodular systems and Hitchcock-type independent flows, Slider-pinning rigidity: a Maxwell-Laman-type theorem, On a matroid defined by ear-decompositions of graphs, Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested, Good orientations of unions of edge‐disjoint spanning trees, Good acyclic orientations of 4‐regular 4‐connected graphs, The \(b\)-branching problem in digraphs, Color-avoiding connected spanning subgraphs with minimum number of edges, Augmenting the rigidity of a graph in \(\mathbb R^{2}\), The complexity of finding low chromatic spanning sub(di)graphs with prescribed connectivity properties, Bracing rhombic structure by one-dimensional tensegrities, Finding well-balanced pairs of edge-disjoint trees in edge-weighted graphs, Matroid-constrained vertex cover, Unnamed Item, Recent Developments in Discrete Convex Analysis, Matroids—the Engineers’ Revenge, Splitting off operation for binary matroids and its applications, Tractability index of hybrid equations for circuit simulation, On persistent directed graphs, Forests, frames, and games: Algorithms for matroid sums and applications, Partitioning the bases of the union of matroids, Index characterization of differential-algebraic equations in hybrid analysis for circuit simulation, Matrices over finite fields and their Kirchhoff graphs, Extension of line-splitting operation from graphs to binary matroids, Hierarchical decomposition of symmetric discrete systems by matroid and group theories, On the notion of generalized minor in topological network theory and matroids, New algorithms for the intersection problem of submodular systems, Legendre duality in combinatorial study of matrix pencils, Forbidden-minors for graphic and cographic es-splitting matroids, Efficient high-precision matrix algebra on parallel architectures for nonlinear combinatorial optimization, Hybrid port--Hamiltonian systems: from parameterized incidence matrices to hybrid automata, On the 2-sum in rigidity matroids, Self-adjointness and skew-adjointness criteria involving powers of linear relations, Generalized matroid matching, Exact and approximation algorithms for weighted matroid intersection, Unnamed Item, A module-theoretic approach to matroids, Random sampling and greedy sparsification for matroid optimization problems, Complexity of some arc-partition problems for digraphs, Boundary Value Problem on a Weighted Graph Relevant to the Static Analysis of Truss Structures, Splitting in a binary matroid, Graph theoretical duality perspective on conjugate structures and its applications, Optimization models for reaction networks: information divergence, quadratic programming and Kirchhoff's laws, One Brick at a Time: A Survey of Inductive Constructions in Rigidity Theory, Minimum cycle bases of graphs over different fields, A graph theoretical approach to monotonicity with respect to initial conditions II, Determination of the bases of a splitting matroid, Bimonotone linear inequalities and sublattices of \(\mathbb R^n\)
