Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number

From MaRDI portal
Publication:450563

DOI10.1016/j.jda.2011.12.012zbMath1247.68109OpenAlexW2088153883MaRDI QIDQ450563

Vadim V. Lozin, Haiko Müller, Dieter Rautenbach, Konrad K. Dabrowski

Publication date: 13 September 2012

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2011.12.012




Related Items (9)



Cites Work


This page was built for publication: Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number