论文标题
迅速变得非常容易的严重问题
Hard Problems That Quickly Become Very Easy
论文作者
论文摘要
如果在顶点删除下关闭图形，则图形类是遗传性的。我们给出了NP-螺态，PSPACE结合和Nexptime-Complete问题的示例，这些问题成为每个遗传图类都可以固定的，并不等于所有图形的类别。
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 for every hereditary graph class that is not equal to the class of all graphs.
