A polytime preprocess algorithm for the maximum independent set problem
From MaRDI portal
Publication:6151535
DOI10.1007/S11590-023-02076-8MaRDI QIDQ6151535FDOQ6151535
Authors: Samuel Kroger, Hamidreza Validi, Illya V. Hicks 
Publication date: 11 March 2024
Published in: Optimization Letters (Search for Journal in Brave)
Recommendations
Cites Work
- Graph theory
- Geometric algorithms and combinatorial optimization
- Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
- Independent set in \(P_5\)-free graphs in polynomial time
- Vertex packings: Structural properties and algorithms
- On maximal independent sets of vertices in claw-free graphs
- Nondeterminism within $P^ * $
- Title not available (Why is that?)
- A REVISION OF MINTY'S ALGORITHM FOR FINDING A MAXIMUM WEIGHT STABLE SET OF A CLAW-FREE GRAPH
- Solving the weighted stable set problem in claw-free graphs via decomposition
- Solving maximum clique in sparse graphs: an \({O(nm+n2^{d/4})}\) algorithm for \(d\)-degenerate graphs
- Vertices Belonging to All or to No Maximum Stable Sets of a Graph
- Using critical sets to solve the maximum independent set problem
- The stable set problem and the thinness of a graph
- A \(2k\)-kernelization algorithm for vertex cover based on crown decomposition
- Why is maximum clique often easy in practice?
- Solving the Distance-Based Critical Node Problem
Cited In (1)
This page was built for publication: A polytime preprocess algorithm for the maximum independent set problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6151535)
