Vertex partitioning problems on graphs with bounded tree width (Q2161252)
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 7567758
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Vertex partitioning problems on graphs with bounded tree width |
scientific article; zbMATH DE number 7567758 |
Statements
Vertex partitioning problems on graphs with bounded tree width (English)
0 references
4 August 2022
0 references
matching cut
0 references
decomposable graphs
0 references
H-free coloring
0 references
parameterized algorithm
0 references
0 references
0 references
0 references
0 references
0.8703338503837585
0 references
0.8599503040313721
0 references
0.8175225853919983
0 references
0.7979026436805725
0 references
0.7934091091156006
0 references
