A Simple and Fast Algorithm for Maximum Independent Set in 3-Degree Graphs
From MaRDI portal
Publication:3404455
DOI10.1007/978-3-642-11440-3_26zbMath1274.68678OpenAlexW1526809436MaRDI QIDQ3404455
Publication date: 9 February 2010
Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-11440-3_26
Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Parameterized edge dominating set in graphs with degree bounded by 3, A refined algorithm for maximum independent set in degree-4 graphs, New parameterized algorithms for the edge dominating set problem, An exact algorithm for maximum independent set in degree-5 graphs, Parameterized Edge Dominating Set in Cubic Graphs, Exact algorithms for maximum independent set, On the Independence Number of Graphs with Maximum Degree 3