The Induced Minor Containment problem takes as input two graphs G and H, and asks whether G has H as an induced minor. We show that this problem is fixed parameter tractable inSCOPUS: cp.jinfo:eu-repo/semantics/publishe
AbstractThe H-Minor containment problem asks whether a graph G contains some fixed graph H as a mino...
International audienceA graph H is an induced minor of a graph G if it can be obtained from an induc...
International audienceA graph H is an induced minor of a graph G if it can be obtained from an induc...
AbstractThe Induced Minor Containment problem takes as input two graphs G and H, and asks whether G ...
AbstractThe Induced Minor Containment problem takes as input two graphs G and H, and asks whether G ...
The problems Contractibility and Induced Minor are to test whether a graph G contains a graph H as a...
The Induced Minor Containment problem takes as input two graphs G and H, and asks whether G has H as...
The problems Contractibility and Induced Minor are to test whether a graph G contains a graph H as a...
AbstractThe H-Minor containment problem asks whether a graph G contains some fixed graph H as a mino...
The Induced Minor problem is that of testing whether a graph G can be modified into a graph H by a s...
The Induced Minor problem is to test whether a graph G contains a graph H as an induced minor, i.e.,...
A graph containment problem is that of deciding whether one graph called the host graph can be modif...
The Induced Minor problem is to test whether a graph G contains a graph H as an induced minor, i.e. ...
AbstractThe Induced Minor problem is to test whether a graph G contains a graph H as an induced mino...
A graph containment problem is to decide whether one graph can be modified into some other graph by ...
AbstractThe H-Minor containment problem asks whether a graph G contains some fixed graph H as a mino...
International audienceA graph H is an induced minor of a graph G if it can be obtained from an induc...
International audienceA graph H is an induced minor of a graph G if it can be obtained from an induc...
AbstractThe Induced Minor Containment problem takes as input two graphs G and H, and asks whether G ...
AbstractThe Induced Minor Containment problem takes as input two graphs G and H, and asks whether G ...
The problems Contractibility and Induced Minor are to test whether a graph G contains a graph H as a...
The Induced Minor Containment problem takes as input two graphs G and H, and asks whether G has H as...
The problems Contractibility and Induced Minor are to test whether a graph G contains a graph H as a...
AbstractThe H-Minor containment problem asks whether a graph G contains some fixed graph H as a mino...
The Induced Minor problem is that of testing whether a graph G can be modified into a graph H by a s...
The Induced Minor problem is to test whether a graph G contains a graph H as an induced minor, i.e.,...
A graph containment problem is that of deciding whether one graph called the host graph can be modif...
The Induced Minor problem is to test whether a graph G contains a graph H as an induced minor, i.e. ...
AbstractThe Induced Minor problem is to test whether a graph G contains a graph H as an induced mino...
A graph containment problem is to decide whether one graph can be modified into some other graph by ...
AbstractThe H-Minor containment problem asks whether a graph G contains some fixed graph H as a mino...
International audienceA graph H is an induced minor of a graph G if it can be obtained from an induc...
International audienceA graph H is an induced minor of a graph G if it can be obtained from an induc...
DOI
Add to ORKG