On the Bipartite Unique Perfect Matching Problem

DOI10.1007/11786986_40zbMath1223.68057OpenAlexW1571988660MaRDI QIDQ3613781

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

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

Related Items (2)

Log-space algorithms for paths and matchings in \(k\)-trees ⋮ Unnamed Item

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