加载中…
2016-07-08
Strengthening Hardness Results to 3-Connected Planar Graphs
Giordano Da LozzoIgnaz Rutter
文献摘要
In this paper we extend some classical NP-hardness results from the class of 2-connected planar graphs to subclasses of 3-connected planar graphs. The reduction are partly based on a new graph augmentation, which may be of independent interest.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本