\(k\)-best solutions of MSO problems on tree-decomposable graphs (Q5111875)
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: k-best solutions of MSO problems on tree-decomposable graphs |
scientific article; zbMATH DE number 7205200
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \(k\)-best solutions of MSO problems on tree-decomposable graphs |
scientific article; zbMATH DE number 7205200 |
Statements
27 May 2020
0 references
graph algorithm
0 references
\(k\)-best solution
0 references
monadic second-order logic
0 references
treewidth
0 references
0.7823355197906494
0 references
0.768279492855072
0 references
