Algorithmica 2021 31;83(8):2634-2650. Epub 2020 Jul 31.
Department of Theoretical Computer Science, Faculty of Mathematics and Computer Science, Jagiellonian University, Kraków, Poland.
Let and be hereditary graph classes. Consider the following problem: given a graph , find a largest, in terms of the number of vertices, induced subgraph of that belongs to . We prove that it can be solved in time, where is the number of vertices of , if the following conditions are satisfied:the graphs in are sparse, i. Read More