Vertex-bipartition: a unified approach for kernelization of graph linear layout problems parameterized by vertex cover (Q6610085)
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 7918135
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Vertex-bipartition: a unified approach for kernelization of graph linear layout problems parameterized by vertex cover |
scientific article; zbMATH DE number 7918135 |
Statements
Vertex-bipartition: a unified approach for kernelization of graph linear layout problems parameterized by vertex cover (English)
0 references
24 September 2024
0 references
linear layouts
0 references
vertex cover number
0 references
kernelization
0 references
uncloneable vertex
0 references
0 references
0 references
0.7701757550239563
0 references
0.7676184177398682
0 references
0.7599787712097168
0 references
0.7565852403640747
0 references
