Two Algorithms for Bipartite Graphs

Cited in

(23)

Menger-decomposition of a graph and its application to the structural analysis of a large-scale system of equations
Predicting the structure of sparse orthogonal factors
Block triangularization of skew-symmetric matrices
A geometric framework for sparse matrix problems
A manifold-based approach to sparse global constraint satisfaction problems
Graft analogue of general Kotzig-Lovász decomposition
A robust approach for finding all well-separated solutions of sparse systems of nonlinear equations
Some graphical properties of matrices with non-negative entries
Disclosing barriers: a generalization of the canonical partition based on Lovász's formulation
Constrained Min-Cut Replication for K-Way Hypergraph Partitioning
Fault Diagnosis Of A Water For Injection System Using Enhanced Structural Isolation
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
A Representation of bipartite graphs by digraphs and its programming application
Class of optimization algorithms for the solution of large nonlinear programming problems. II
scientific article; zbMATH DE number 3272649 (Why is no real title available?)
Some Results on Sparse Matrices
On the Inversion of Sparse Matrices
Excluding a planar matching minor in bipartite graphs
Basilica: new canonical decomposition in matching theory
Matchings, covers, and Jacobian matrices
Structural theorems for submodular functions, polymatroids and polymatroid intersections
A graph theoretic upper bound on the permanent of a nonnegative integer matrix. I

This page was built for publication: Two Algorithms for Bipartite Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5726283)