For a graph search algorithm, the end vertex problem is concerned with which vertices of a graph can be the last visited by this algorithm. We show that for both lexicographic depth-first search and maximum cardinality search, the end vertex problem is NP-complete on bipartite graphs, even if the maximum degree of the graph is bounded.

中文翻译：

---

在二部图上搜索图的结束顶点

对于图搜索算法，末端顶点问题与图的哪些顶点可以是该算法最后访问的有关。我们表明，对于词典深度优先搜索和最大基数搜索，即使图的最大度数是有界的，端顶点问题在二部图上也是 NP 完全的。