Proceedings
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms
Polynomial-time algorithm for Maximum Weight Independent Set on P6-free graphs
Pages 1257 - 1271
Abstract
In the classic Maximum Weight Independent Set problem we are given a graph G with a nonnegative weight function on vertices, and the goal is to find an independent set in G of maximum possible weight. While the problem is NP-hard in general, we give a polynomial-time algorithm working on any P6-free graph, that is, a graph that has no path on 6 vertices as an induced subgraph. This improves the polynomial-time algorithm on P5-free graphs of Lokshtanov et al. [11], and the quasipolynomial-time algorithm on P6-free graphs of Lokshtanov et al. [12]. The main technical contribution leading to our main result is enumeration of a polynomial-size family ℱ of vertex subsets with the following property: for every maximal independent set I in the graph, ℱ contains all maximal cliques of some minimal chordal completion of G that does not add any edge incident to a vertex of I.
Formats available
You can view the full content in the following formats:
Information & Authors
Information
Published In
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms
Pages: 1257 - 1271
Editor: Timothy M. Chan, University of Illinois at Urbana-Champaign, USA
ISBN (Online): 978-1-61197-548-2
Copyright
© 2019 by the Society for Industrial and Applied Mathematics.
History
Published online: 2 January 2019
Authors
Metrics & Citations
Metrics
Citations
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.
Cited By
- Independent sets of maximum weight beyond claw-free graphs and related problemsTheoretical Computer Science | 1 Jan 2025
- Max Weight Independent Set in Graphs with No Long Claws: An Analog of the Gyárfás’ Path ArgumentACM Transactions on Computation Theory, Vol. 16, No. 2 | 14 March 2024
- 1-Extendability of Independent SetsAlgorithmica, Vol. 86, No. 3 | 8 June 2023
- Output-Sensitive Enumeration of Potential Maximal Cliques in Polynomial SpaceCombinatorial Algorithms | 22 June 2024
- Maximum Bipartite Subgraphs of Geometric Intersection GraphsInternational Journal of Computational Geometry & Applications, Vol. 33, No. 03n04 | 16 December 2023
- Complexity of C-coloring in hereditary classes of graphsInformation and Computation, Vol. 292 | 1 Jun 2023
- Feedback Vertex Set and Even Cycle Transversal for $H$-Free Graphs: Finding Large Block GraphsSIAM Journal on Discrete Mathematics, Vol. 36, No. 4 | 4 October 2022
- New Results on Independent Sets in Extensions of $$2K_2$$-free GraphsGraphs and Combinatorics, Vol. 38, No. 4 | 29 July 2022
- 1-Extendability of Independent SetsCombinatorial Algorithms | 29 May 2022
- Induced Disjoint Paths and Connected Subgraphs for H-Free GraphsGraph-Theoretic Concepts in Computer Science | 1 October 2022
- Combining Decomposition Approaches for the Maximum Weight Stable Set ProblemSSRN Electronic Journal, Vol. 81 | 1 Jan 2022
- Independent Sets in ($$P_4+P_4$$,Triangle)-Free GraphsGraphs and Combinatorics, Vol. 37, No. 6 | 2 June 2021
- Subexponential-Time Algorithms for Finding Large Induced Sparse SubgraphsAlgorithmica, Vol. 83, No. 8 | 31 July 2020
- (Theta, triangle)‐free and (even hole, K4)‐free graphs. Part 2: Bounds on treewidthJournal of Graph Theory, Vol. 97, No. 4 | 25 March 2021
- Finding large induced sparse subgraphs in c >t -free graphs in quasipolynomial timeProceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 15 June 2021
- Vertex Cover at Distance on H-Free GraphsCombinatorial Algorithms | 30 June 2021
- Computing Weighted Subset Transversals in H-Free GraphsAlgorithms and Data Structures | 31 July 2021
- Independent Set on -Free Graphs in Quasi-Polynomial Time2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) | 1 Nov 2020
- Parameterized Complexity of Independent Set in H-Free GraphsAlgorithmica, Vol. 82, No. 8 | 17 June 2020
- Colouring (Pr + Ps)-Free GraphsAlgorithmica, Vol. 82, No. 7 | 25 January 2020
- Computing Subset Transversals in H-Free GraphsGraph-Theoretic Concepts in Computer Science | 9 October 2020
- Parameterized Inapproximability of Independent Set in H-Free GraphsGraph-Theoretic Concepts in Computer Science | 9 October 2020
- Connected Vertex Cover for $$(sP_1+P_5)$$-Free GraphsAlgorithmica, Vol. 82, No. 1 | 20 June 2019
- On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear ForestFundamentals of Computation Theory | 10 July 2019
- A Polynomial-Time Algorithm for the Independent Set Problem in $$\{{P_{10}},C_4,C_6\}$$ -Free GraphsGraph-Theoretic Concepts in Computer Science | 12 September 2019
View Options
View options
- Access via your Institution
- Questions about how to access this content? Contact SIAM at [email protected].