Proof of `Optimal tree decompositions from a given one`
groundedproofs/Lax117284Proofs/Treewidth/Fun/Final.lean · lax-117284
What this proof establishes
no assumptions
Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.
Description
The improvement step of Bodlaender–Kloks on a word RAM: given a nice decomposition of width it returns one of width at most or , proved by a dispatcher over the same exact algorithm (if the given decomposition is returned; otherwise the main algorithm runs on the graph and ).