We prove that, for any fixed k, one can construct a linear time algorithm that checks if a graph has branchwidth at most k and, if so, outputs a branch decomposition of minimum width.