On the sets of perfect matchings for two bipartite graphs

DOI10.1016/S0020-0190(99)00046-0zbMath1002.68066OpenAlexW2010249765MaRDI QIDQ1606933

Arnold Rosenbloom

Publication date: 25 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(99)00046-0

zbMATH Keywords

bipartite graphsperfect matchings

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

The maximum fuzzy weighted matching models and hybrid genetic algorithm

This page was built for publication: On the sets of perfect matchings for two bipartite graphs