Approximation and tidying—a problem kernel for s-Plex cluster vertex deletion › Research Explorer

Novosibirsk State University's Research Portal

Approximation and tidying—a problem kernel for s-Plex cluster vertex deletion

Research output: Contribution to journal › Article › peer-review

DOI

https://doi.org/10.1007/s00453-011-9492-7
Final published version

René van Bevern
Hannes Moser
Rolf Niedermeier

Original language	English
Pages (from-to)	930-950
Number of pages	21
Journal	Algorithmica
Volume	62
Issue number	3-4
DOIs	https://doi.org/10.1007/s00453-011-9492-7
Publication status	Published - 1 Jan 2012
Externally published	Yes

OECD FOS+WOS

Research areas

Computational intractability, Fixed-parameter tractability, Graph-based data clustering, NP-hard graph problem, Polynomial-time data reduction

ID: 22341567