Maximum weight independent set for \(\ell\)claw-free graphs in polynomial time

DOI10.1016/j.dam.2017.11.029zbMath1380.05147arXiv1602.05838MaRDI QIDQ1701093

Andreas Brandstädt, Raffaele Mosca

Publication date: 22 February 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1602.05838

zbMATH Keywords

polynomial time; maximum weight independent set problem; \(\ell\)claw-free graphs

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

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

05C22: Signed and weighted graphs