FPT algorithms to compute the elimination distance to bipartite graphs and more (Q2672425)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: FPT algorithms to compute the elimination distance to bipartite graphs and more |
scientific article; zbMATH DE number 7538568
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | FPT algorithms to compute the elimination distance to bipartite graphs and more |
scientific article; zbMATH DE number 7538568 |
Statements
FPT algorithms to compute the elimination distance to bipartite graphs and more (English)
0 references
8 June 2022
0 references
elimination distance
0 references
FPT
0 references
odd cycle transversal
0 references
0.88781285
0 references
0.8873036
0 references
0.88343215
0 references
0.87481046
0 references
0.87437063
0 references
0.87116724
0 references
0.8651383
0 references
0.86325574
0 references
0.86325574
0 references
