Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
scientific article - MaRDI portal

scientific article

From MaRDI portal
Publication:3266932

zbMath0091.37502MaRDI QIDQ3266932

A. L. Dulmage, N. S. Mendelsohn

Publication date: 1959


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (39)

Bilateral bargaining in networksA very personal reminiscence on the problem of computational complexityA theorem on the principal structure for independent matchingsMenger-decomposition of a graph and its application to the structural analysis of a large-scale system of equationsStructural solvability of systems of equations —A mathematical formulation for distinguishing accurate and inaccurate numbers in structural analysis of systems—Principal structure of submodular systems and Hitchcock-type independent flowsA new efficient and flexible algorithm for the design of testable subsystemsMatching structure of symmetric bipartite graphs and a generalization of Pólya's problemBlock triangularization of skew-symmetric matricesA robust approach for finding all well-separated solutions of sparse systems of nonlinear equationsDecomposition of a bidirected graph into strongly connected components and its signed poset structureDecomposition theorems for square-free 2-matchings in bipartite graphsCombinatorial Canonical Form of Layered Mixed Matrices and Its Application to Block-Triangularization of Systems of Linear/Nonlinear EquationsPrincipal structures of submodular systemsPopular Matchings with Ties and Matroid ConstraintsExcluding a planar matching minor in bipartite graphsConstrained Min-Cut Replication for K-Way Hypergraph PartitioningMaking Bipartite Graphs DM-IrreducibleBargaining in a network of buyers and sellers.Computing DM-decomposition of a partitioned matrix with rank-1 blocksHierarchical decomposition of symmetric discrete systems by matroid and group theoriesA manifold-based approach to sparse global constraint satisfaction problemsA Method for Sensor Placement Taking into Account Diagnosability CriteriaFault Diagnosis Of A Water For Injection System Using Enhanced Structural IsolationCombinatorial aspects of rectangular non-negative matricesOn the point-core of a graphOn the Inversion of Sparse MatricesSome graphical properties of matrices with non-negative entriesPrincipal structure of layered mixed matricesStructural theorems for submodular functions, polymatroids and polymatroid intersectionsDecomposition Theorems for Square-free 2-matchings in Bipartite GraphsSome recent results in combinatorial approaches to dynamical systemsGraft analogue of general Kotzig-Lovász decompositionMaximum rank matrix completionEnumeration of BC-subtrees of treesDetection of structural inconsistency in systems of equations with degrees of freedom and its applicationsDisclosing Barriers: A Generalization of the Canonical Partition Based on Lovász’s FormulationPredicting the structure of sparse orthogonal factorsGraph-theoretic approach to symbolic analysis of linear descriptor systems




This page was built for publication: