Implementing Courcelle's Theorem in a declarative framework for dynamic programming
From MaRDI portal
Publication:3133156
DOI10.1093/logcom/exv089zbMath1380.68215OpenAlexW2407301128MaRDI QIDQ3133156
Bernhard Bliem, Reinhard Pichler, Stefan Woltran
Publication date: 13 February 2018
Published in: Journal of Logic and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/logcom/exv089
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Dynamic programming (90C39) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
This page was built for publication: Implementing Courcelle's Theorem in a declarative framework for dynamic programming