Article thumbnail

On exploring always-connected temporal graphs of small pathwidth

By HL Hans Bodlaender and TC van der Zanden


\u3cp\u3eWe 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.\u3c/p\u3

Publisher: 'Elsevier BV'
Year: 2019
OAI identifier:
Provided by: Repository TU/e
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.