On the Bipartite Unique Perfect Matching Problem

DOI10.1007/11786986_40MaRDI QIDQ3613781zbMATH OpenOpenAlexFDO

Authors Thanh Minh Hoang, Meena Mahajan, Thomas Thierauf

Publication date 12 March 2009

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11786986_40

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• The uniquely solvable bipartite matching problem
• On the uniqueness of perfect matchings in bipartite graphs
• Space complexity of perfect matching in bounded genus bipartite graphs
• Space complexity of perfect matching in bounded genus bipartite graphs
• Bipartite perfect matching is in quasi-NC

Cited in

(10)

• The uniquely solvable bipartite matching problem
• Solution to a problem of C. D. Godsil regarding bipartite graphs with unique perfect matching
• On the sets of perfect matchings for two bipartite graphs
• On the uniqueness of perfect matchings in bipartite graphs
• On the computational complexity of the bipartizing matching problem
• Space complexity of perfect matching in bounded genus bipartite graphs
• Log-space algorithms for paths and matchings in k-trees
• Space complexity of perfect matching in bounded genus bipartite graphs
• scientific article; zbMATH DE number 7359421 (Why is no real title available?)
• On maximum bipartite matching with separation

This page was built for publication: On the Bipartite Unique Perfect Matching Problem

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