Parameterized complexity of vertex splitting to pathwidth at most 1 (Q6639742)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7945740
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterized complexity of vertex splitting to pathwidth at most 1 |
scientific article; zbMATH DE number 7945740 |
Statements
Parameterized complexity of vertex splitting to pathwidth at most 1 (English)
0 references
18 November 2024
0 references
algorithms
0 references
graphs
0 references
computational complexity
0 references
fixed-parameterized tractability
0 references
kernelization
0 references
branching algorithm
0 references
vertex splitting
0 references
pathwidth 1
0 references
2-layer drawing
0 references
0.7753168940544128
0 references
0.7737038731575012
0 references
0.7672792673110962
0 references
0.7324721217155457
0 references
0.7273035049438477
0 references
