Hard Problems That Quickly Become Very Easy

Barnaby Martin, Daniël Paulusma, Siani Smith

A graph class is hereditary if it is closed under vertex deletion. We give examples of NP-hard, PSPACE-complete and NEXPTIME-complete problems that become constant-time solvable fo…