Finding good tree decompositions by local search (Q2839209): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Complexity of Finding Embeddings in a <i>k</i>-Tree / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2816028 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Graph minors. XIII: The disjoint paths problem / rank | |||
Normal rank | |||
Latest revision as of 14:15, 6 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding good tree decompositions by local search |
scientific article |
Statements
Finding good tree decompositions by local search (English)
0 references
4 July 2013
0 references
algorithmic graph theory
0 references
local search
0 references
tree decomposition
0 references
tree-width
0 references
