Planarizing gadgets for perfect matching do not exist

DOI10.1145/2934310MaRDI QIDQ4973859zbMATH OpenOpenAlexFDO

Authors Rohit Gurjar, Arpita Korwar, Jochen Messner, Simon Straub, Thomas Thierauf

Publication date 6 December 2019

Published in ACM Transactions on Computation Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2934310

zbMATH Keywords

perfect matchingplanar graphsparallel complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Planarizing Gadgets for Perfect Matching Do Not Exist
• Planar graph perfect matching is in NC
• Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite Cases
• Generalized planar matching
• On cuts and matchings in planar graphs

Cited in

(2)

• Planarizing Gadgets for Perfect Matching Do Not Exist
• On the complexity of finding central configurations of the graph-generalized ( n^2 - 1 )-puzzle

This page was built for publication: Planarizing gadgets for perfect matching do not exist

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