Matroid theory and its applications in electric network theory and in statics
From MaRDI portal
Publication:1210828
zbMath0723.05023MaRDI QIDQ1210828
Publication date: 5 June 1993
Published in: Algorithms and Combinatorics (Search for Journal in Brave)
05B35: Combinatorial aspects of matroids and geometric lattices
52C25: Rigidity and flexibility of structures (aspects of discrete geometry)
94C15: Applications of graph theory to circuits and networks
70C20: Statics
05-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics
Related Items
Persistency in combinatorial optimization problems on matroids, Bipartition constrained edge-splitting in directed graphs, Arc-disjoint spanning sub(di)graphs in digraphs, Bond graphs. I: Acausal equivalence, Source location with rigidity and tree packing requirements, Tensegrity frameworks in one-dimensional space, Rigidity, global rigidity, and graph decomposition, Boundary value problems on weighted networks, A parameterized view on matroid optimization problems, Bracing cubic grids - a necessary condition, Efficient optimal equation formulation in lumped power-conserving systems, Applications of combinatorics to statics --- a second survey, A discrete model for studying existence and uniqueness of solutions in nonlinear resistive circuits, König's theorem and bimatroids, On the graphic matroid parity problem, Polyhedra with submodular support functions and their unbalanced simultaneous exchangeability, Polynomials with the half-plane property and the support theorems, A theorem on the principal structure for independent matchings, A dual approximation approach to weighted matroid intersection, Graded sparse graphs and body-length-direction frameworks, Change of order for regular chains in positive dimension, Sublattices of product spaces: Hulls, representations and counting, The \(d\)-dimensional rigidity matroid of sparse graphs
