Maximum Independent Sets in Subcubic Graphs: New Results
Ararat Harutyunyan, Michael Lampis, Vadim Lozin, J\'er\^ome Monnot
TL;DR
This paper introduces a polynomial-time algorithm for finding maximum independent sets in a specific subclass of subcubic graphs, expanding the understanding of this NP-hard problem.
Contribution
It presents a new polynomial-time solution for a subclass of subcubic graphs, generalizing previous results and advancing the theoretical understanding of the problem.
Findings
Polynomial-time algorithm for a subclass of subcubic graphs
Generalization of previous results on maximum independent sets
Enhanced theoretical understanding of NP-hard problems in graph theory
Abstract
The maximum independent set problem is known to be NP-hard in the class of subcubic graphs, i.e. graphs of vertex degree at most 3. We present a polynomial-time solution in a subclass of subcubic graphs generalizing several previously known results.
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.