An Exact Algorithm for Maximum Independent Set in Degree-5 Graphs
From MaRDI portal
Recommendations
- An exact algorithm for maximum independent set in degree-5 graphs
- On maximum independent sets in \(P_{5}\)-free graphs
- A randomized algorithm for determining dominating sets in graphs of maximum degree five
- An optimal maximal independent set algorithm for bounded-independence graphs
- Maximum independent sets in subclasses of \(P_{5}\)-free graphs
- Exact algorithms for maximum independent set
- Exact Algorithms for Maximum Independent Set
- A refined algorithm for maximum independent set in degree-4 graphs
- A simple and fast algorithm for Maximum Independent Set in 3-degree graphs (extended abstract)
- On the maximum independent set problem in graphs of bounded maximum degree
Cited in
(8)- A randomized algorithm for determining dominating sets in graphs of maximum degree five
- A refined algorithm for maximum independent set in degree-4 graphs
- Exact algorithms for maximum independent set
- An improved exact algorithm for TSP in graphs of maximum degree 4
- scientific article; zbMATH DE number 861311 (Why is no real title available?)
- Exact and Parameterized Algorithms for the Independent Cutset Problem
- Exact and parameterized algorithms for the independent cutset problem
- An exact algorithm for maximum independent set in degree-5 graphs
This page was built for publication: An Exact Algorithm for Maximum Independent Set in Degree-5 Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5405918)