This type of problem, classified  as NP-complete, is notoriously difficult when the graph is sufficiently large.
Ce type de problème, classé comme NP-complet, est réputé difficile quand le graphe est suffisamment grand.