Heuristic and metaheuristic methods for computing graph treewidth (Q5479837): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
Property / describes a project that uses | |||
Property / describes a project that uses: Tabu search / rank | |||
Normal rank |
Revision as of 17:57, 28 February 2024
scientific article; zbMATH DE number 5039977
Language | Label | Description | Also known as |
---|---|---|---|
English | Heuristic and metaheuristic methods for computing graph treewidth |
scientific article; zbMATH DE number 5039977 |
Statements
Heuristic and metaheuristic methods for computing graph treewidth (English)
0 references
11 July 2006
0 references
treewidth
0 references
elimination orderings
0 references
triangulated graphs
0 references
heuristic
0 references
metaheuristic
0 references
computational experiments
0 references