Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs

Let [Formula: see text] and [Formula: see text] be hereditary graph classes. Consider the following problem: given a graph [Formula: see text] , find a largest, in terms of the number of vertices, induced subgraph of G that belongs to [Formula: see text] . We prove that it can be solved in [Formula:...

Descripción completa

Detalles Bibliográficos
Autores principales: Novotná, Jana, Okrasa, Karolina, Pilipczuk, Michał, Rzążewski, Paweł, van Leeuwen, Erik Jan, Walczak, Bartosz
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Springer US 2020
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8550324/
https://www.ncbi.nlm.nih.gov/pubmed/34720297
http://dx.doi.org/10.1007/s00453-020-00745-z

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8550324/
https://www.ncbi.nlm.nih.gov/pubmed/34720297
http://dx.doi.org/10.1007/s00453-020-00745-z

Ejemplares similares