Strengthening Hardness Results to 3-Connected Planar Graphs
Giordano Da Lozzo, Ignaz Rutter
TL;DR
This paper enhances NP-hardness results for certain computational problems by extending them from 2-connected to 3-connected planar graphs, introducing a novel graph augmentation technique.
Contribution
It presents a new graph augmentation method and extends classical NP-hardness proofs to 3-connected planar graphs.
Findings
NP-hardness results now apply to 3-connected planar graphs
Introduces a novel graph augmentation technique
Extends classical reductions to more connected graph classes
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Geometry and Mesh Generation · Advanced Graph Theory Research · Interconnection Networks and Systems