Problems that are NP but polynomial on graphs of bounded treewidth
-
30-10-2019 - |
Pergunta
I heard here that the Hamiltonian cycle problem is polynomial on graphs of bounded treewidth.
I am interested in examples/references to different problems which is essentially hard but having polynomial complexity on graphs of bounded treewidth.
Nenhuma solução correta
Licenciado em: CC-BY-SA com atribuição
Não afiliado a cs.stackexchange