Skip to main content
. Author manuscript; available in PMC: 2016 Jun 6.
Published in final edited form as: Adv Neural Inf Process Syst. 2015 Dec;28:3079–3087.

Algorithm 1.

HW(G, k): Compute if hw(G) ≤ k

if G has no edges then
    return true
end if
if k = 0 then
    return false
end if
for e ∈ edges(G) do
    Let be the graph that results from removing e from the connected component of G that
    contains e
    if HW(Ḡ, k − 1) then
        return true
    end if
end for
return false