scientific article; zbMATH DE number 3149610
From MaRDI portal
Publication:3266932
zbMATH Open0091.37502MaRDI QIDQ3266932FDOQ3266932
Authors: A. L. Dulmage, N. S. Mendelsohn 
Publication date: 1959
Title of this publication is not available (Why is that?)
Cited In (41)
- Block triangularization of skew-symmetric matrices
- A very personal reminiscence on the problem of computational complexity
- Hierarchical decomposition of symmetric discrete systems by matroid and group theories
- Structural theorems for submodular functions, polymatroids and polymatroid intersections
- Menger-decomposition of a graph and its application to the structural analysis of a large-scale system of equations
- Excluding a planar matching minor in bipartite graphs
- Combinatorial aspects of rectangular non-negative matrices
- Some recent results in combinatorial approaches to dynamical systems
- Offline analysis of the relaxed upper boundedness for online estimation of optimal event sequences in partially observable Petri nets
- Computing DM-decomposition of a partitioned matrix with rank-1 blocks
- On the Inversion of Sparse Matrices
- Decomposition theorems for square-free 2-matchings in bipartite graphs
- Detection of structural inconsistency in systems of equations with degrees of freedom and its applications
- A theorem on the principal structure for independent matchings
- A robust approach for finding all well-separated solutions of sparse systems of nonlinear equations
- A new efficient and flexible algorithm for the design of testable subsystems
- Principal structure of submodular systems and Hitchcock-type independent flows
- Bargaining in a network of buyers and sellers.
- Decomposition of a bidirected graph into strongly connected components and its signed poset structure
- Principal structures of submodular systems
- Decomposition theorems for square-free 2-matchings in bipartite graphs
- A Method for Sensor Placement Taking into Account Diagnosability Criteria
- Graph-theoretic approach to symbolic analysis of linear descriptor systems
- Predicting the structure of sparse orthogonal factors
- Enumeration of BC-subtrees of trees
- Maximum rank matrix completion
- Bilateral bargaining in networks
- Matching structure of symmetric bipartite graphs and a generalization of Pólya's problem
- Popular matchings with ties and matroid constraints
- Structural solvability of systems of equations —A mathematical formulation for distinguishing accurate and inaccurate numbers in structural analysis of systems—
- Combinatorial Canonical Form of Layered Mixed Matrices and Its Application to Block-Triangularization of Systems of Linear/Nonlinear Equations
- Making bipartite graphs DM-irreducible
- On the point-core of a graph
- Graft analogue of general Kotzig-Lovász decomposition
- Principal structure of layered mixed matrices
- Basilica: new canonical decomposition in matching theory
- Constrained Min-Cut Replication for K-Way Hypergraph Partitioning
- Some graphical properties of matrices with non-negative entries
- Disclosing barriers: a generalization of the canonical partition based on Lovász's formulation
- Fault Diagnosis Of A Water For Injection System Using Enhanced Structural Isolation
- A manifold-based approach to sparse global constraint satisfaction problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3266932)
