Two Algorithms for Bipartite Graphs
From MaRDI portal
Publication:5726283
DOI10.1137/0111014zbMath0116.40805OpenAlexW2044866738MaRDI QIDQ5726283
A. L. Dulmage, N. S. Mendelsohn
Publication date: 1963
Published in: Journal of the Society for Industrial and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0111014
Related Items
A geometric framework for sparse matrix problems, Menger-decomposition of a graph and its application to the structural analysis of a large-scale system of equations, Structural solvability of systems of equations —A mathematical formulation for distinguishing accurate and inaccurate numbers in structural analysis of systems—, Class of optimization algorithms for the solution of large nonlinear programming problems. II, Block triangularization of skew-symmetric matrices, A robust approach for finding all well-separated solutions of sparse systems of nonlinear equations, Combinatorial Canonical Form of Layered Mixed Matrices and Its Application to Block-Triangularization of Systems of Linear/Nonlinear Equations, Excluding a planar matching minor in bipartite graphs, Constrained Min-Cut Replication for K-Way Hypergraph Partitioning, Unnamed Item, Matchings, covers, and Jacobian matrices, Some Results on Sparse Matrices, A manifold-based approach to sparse global constraint satisfaction problems, Fault Diagnosis Of A Water For Injection System Using Enhanced Structural Isolation, On the Inversion of Sparse Matrices, Some graphical properties of matrices with non-negative entries, Structural theorems for submodular functions, polymatroids and polymatroid intersections, Graft analogue of general Kotzig-Lovász decomposition, A Representation of bipartite graphs by digraphs and its programming application, A graph theoretic upper bound on the permanent of a nonnegative integer matrix. I, Disclosing Barriers: A Generalization of the Canonical Partition Based on Lovász’s Formulation, Predicting the structure of sparse orthogonal factors
