On approximation properties of the Independent set problem for degree 3 graphs

DOI10.1007/3-540-60220-8_84zbMath1502.68207WikidataQ56335600 ScholiaQ56335600MaRDI QIDQ5057456

Toshihiro Fujito, Piotr Berman

Publication date: 16 December 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60220-8_84

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

68W25: Approximation algorithms

Related Items

Minus domination in small-degree graphs, Conversion of coloring algorithms into maximum weight independent set algorithms