Finding disjoint paths in split graphs (Q493652)
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: Finding disjoint paths in split graphs |
scientific article; zbMATH DE number 6478533
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding disjoint paths in split graphs |
scientific article; zbMATH DE number 6478533 |
Statements
Finding disjoint paths in split graphs (English)
0 references
4 September 2015
0 references
disjoint paths
0 references
computational complexity
0 references
parameterized complexity
0 references
polynomial kernel
0 references
split graphs
0 references
0.9955890774726868
0 references
0.9246509075164796
0 references
0.8880026340484619
0 references
0.7932380437850952
0 references
0.7919960618019104
0 references
