On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem
Sign Up to like & getrecommendations! Published in 2020 at "Algorithmica"
DOI: 10.1007/s00453-020-00758-8
Abstract: We study the parameterized complexity of the Bounded-Degree Vertex Deletion problem (BDD), where the aim is to find a maximum induced subgraph whose maximum degree is below a given degree bound. Our focus lies on… read more here.
Keywords: bounded degree; degree vertex; vertex deletion; problem ... See more keywords