Polynomial-time algorithms for the longest induced path and induced disjoint paths problems on graphs of bounded mim-width (Q5111880)
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: Polynomial-time algorithms for the longest induced path and induced disjoint paths problems on graphs of bounded mim-width |
scientific article; zbMATH DE number 7205205
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial-time algorithms for the longest induced path and induced disjoint paths problems on graphs of bounded mim-width |
scientific article; zbMATH DE number 7205205 |
Statements
27 May 2020
0 references
graph width parameters
0 references
dynamic programming
0 references
graph classes
0 references
induced paths
0 references
induced topological minors
0 references
0 references
0 references
0.9491450786590576
0 references
0.7948158383369446
0 references
0.7886852622032166
0 references
0.782156765460968
0 references
0.7807266116142273
0 references
