An Iterative Heuristic Algorithm for Tree Decomposition

DOI10.1007/978-3-540-70807-0_9zbMath1159.90499OpenAlexW1801000304MaRDI QIDQ3625014

Nysret Musliu

Publication date: 7 May 2009

Published in: Recent Advances in Evolutionary Computation for Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70807-0_9

zbMATH Keywords

heuristicstree decompositionconstraint satisfaction problemgraph decompositioniterated local search

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Artificial intelligence (68T99)

Related Items (3)

Positive-instance driven dynamic programming for treewidth ⋮ Towards fixed-parameter tractable algorithms for abstract argumentation ⋮ Positive-Instance Driven Dynamic Programming for Treewidth.

This page was built for publication: An Iterative Heuristic Algorithm for Tree Decomposition