ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR11-148 | 3rd November 2011 13:55

Planarizing Gadgets for Perfect Matching do not Exist

RSS-Feed




TR11-148
Authors: Rohit Gurjar, Arpita Korwar, Jochen Messner, Simon Straub, Thomas Thierauf
Publication: 4th November 2011 16:30
Downloads: 1244
Keywords: 


Abstract:

To compare the complexity of the perfect matching problem for general graphs with that for planar graphs, one might try to come up with a reduction from the perfect matching problem to the planar perfect matching problem.
The obvious way to construct such a reduction is via a {\em planarizing gadget\/}, a planar graph which replaces all edge crossings of a given graph.
We show that no such gadget exists. This provides a further indication that the complexity of the two problems is different.



ISSN 1433-8092 | Imprint