加载中…
2018-07-31
On Exploring Temporal Graphs of Small Pathwidth
Hans L. BodlaenderTom C. van der Zanden
文献摘要
We show that the Temporal Graph Exploration Problem is NP-complete, even when the underlying graph has pathwidth 2 and at each time step, the current graph is connected.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本