For such a problem in which the graph property is defined by multiple forbidden induced subgraphs, branching process is trivially performed on each subgraph.
For such a problem in which the graph property is defined by multiple forbidden induced subgraphs, branching process is trivially per- formed on each subgraph.
Improved parameterized algorithms for edge modification problems for several graph properties such as proper interval, 3-leaf power, threshold and ...
An Effective Branching Strategy for Some Parameterized Edge Modification Problems with Multiple Forbidden Induced Subgraphs.
In this paper, we present a simple strategy for deriving significantly improved branching rules to deal with multiple forbidden subgraphs by edge modifications.
Branching on forbidden induced subgraphs is a genetic strategy to obtain parameterized algorithms for many edge modification problems. For such a problem in ...
An Effective Branching Strategy for Some Parameterized Edge Modification Problems with Multiple Forbidden Induced Subgraphs. Lecture Notes in Computer ...
An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs. Journal of Combinatorial and Optimization, 2015 ...
We introduce a novel and general branching strategy that branches on the forbidden subgraphs of a relaxed class of graphs. By using the class of P 4-sparse ...
Missing: Induced | Show results with:Induced
An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs. https://doi.org/10.1007/s10878-014-9733-1 ·.