Planarizing gadgets for perfect matching do not exist

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

TOCT（2016）

引用 5|浏览37

暂无评分

摘要

To reduce a graph problem to its planar version, a standard technique is to replace crossings in a drawing of the input graph by planarizing gadgets. We show unconditionally that such a reduction is not possible for the perfect matching problem and also extend this to some other problems related to perfect matching. We further show that there is no planarizing gadget for the Hamiltonian cycle problem.

查看译文

关键词

planarizing gadget,standard technique,planar version,perfect matching problem,perfect matching,graph problem,hamiltonian cycle problem,input graph

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要