An Iterative Heuristic Algorithm for Tree Decomposition
From MaRDI portal
Publication:3625014
DOI10.1007/978-3-540-70807-0_9zbMath1159.90499MaRDI QIDQ3625014
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
heuristics; tree decomposition; constraint satisfaction problem; graph decomposition; iterated local search
90C35: Programming involving graphs or networks
90C59: Approximation methods and heuristics in mathematical programming
68T99: Artificial intelligence
Related Items
Positive-Instance Driven Dynamic Programming for Treewidth., Towards fixed-parameter tractable algorithms for abstract argumentation, Positive-instance driven dynamic programming for treewidth