scientific article; zbMATH DE number 67678

MaRDI QIDQ4013602zbMATHFDO

Authors V. A. Garmash, L. A. Shor, O. L. Shor

Publication date 27 September 1992

zbMATH Keywords

algorithmpartitionadjacency matrixbipartite graphmatchings

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Applications of graph theory to circuits and networks (94C15)

Recommendations

• A perfect matching algorithm for sparse bipartite graphs
• A simple matching algorithm for regular bipartite graphs.
• On the maximum 2-1 matching
• A fast dynamic optimum algorithm for maximum matching in bipartite graphs
• scientific article; zbMATH DE number 1104328

Cited in

(7)

• An algorithmic note on the gallai-milgram theorem
• A Note on n-Critical Bipartite Graphs and Its Application
• scientific article; zbMATH DE number 4033793 (Why is no real title available?)
• A perfect matching algorithm for sparse bipartite graphs
• An algorithm for computing the matching capacity
• An algorithm for matching problems of multi-partite graphs which include one cycle
• Successive partition of edges of bipartite graph into matchings

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 Q4013602)