📣 Help Shape the Future of UKRI's Gateway to Research (GtR)

We're improving UKRI's Gateway to Research and are seeking your input! If you would be interested in being interviewed about the improvements we're making and to have your say about how we can make GtR more user-friendly, impactful, and effective for the Research and Innovation community, please email gateway@ukri.org.

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

First Author: Dabrowski K

Attributed to: The Centre for Discrete Mathematics and its Applications (DIMAP) funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1016/j.jda.2011.12.012

Publication URI: http://dx.doi.org/10.1016/j.jda.2011.12.012

Type: Journal Article/Review

Parent Publication: Journal of Discrete Algorithms

ISSN: 15708667