On exploring always-connected temporal graphs of small pathwidth

Hans L. Bodlaender; Tom C. van der Zanden

doi:10.1016/j.ipl.2018.10.016

On exploring always-connected temporal graphs of small pathwidth

Hans L. Bodlaender^*, Tom C. van der Zanden

^*Corresponding author for this work

Research output: Contribution to journal › Article › Academic › peer-review

59 Downloads (Pure)

Abstract

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. (C) 2018 Elsevier B.V. All rights reserved.

Original language	English
Pages (from-to)	68-71
Number of pages	4
Journal	Information Processing Letters
Volume	142
DOIs	https://doi.org/10.1016/j.ipl.2018.10.016
Publication status	Published - Feb 2019

Keywords

Graph algorithms
Computational complexity
Temporal graphs
Graph exploration
Pathwidth

Access to Document

10.1016/j.ipl.2018.10.016

Full TextFinal published version, 235 KBLicence: Taverne

Cite this

@article{67601d06703645cb88b6b4aea40073e0,

title = "On exploring always-connected temporal graphs of small pathwidth",

abstract = "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. (C) 2018 Elsevier B.V. All rights reserved.",

keywords = "Graph algorithms, Computational complexity, Temporal graphs, Graph exploration, Pathwidth",

author = "Bodlaender, {Hans L.} and {van der Zanden}, {Tom C.}",

note = "data: no data used",

year = "2019",

month = feb,

doi = "10.1016/j.ipl.2018.10.016",

language = "English",

volume = "142",

pages = "68--71",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier Science",

}

TY - JOUR

T1 - On exploring always-connected temporal graphs of small pathwidth

AU - Bodlaender, Hans L.

AU - van der Zanden, Tom C.

N1 - data: no data used

PY - 2019/2

Y1 - 2019/2

N2 - 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. (C) 2018 Elsevier B.V. All rights reserved.

AB - 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. (C) 2018 Elsevier B.V. All rights reserved.

KW - Graph algorithms

KW - Computational complexity

KW - Temporal graphs

KW - Graph exploration

KW - Pathwidth

U2 - 10.1016/j.ipl.2018.10.016

DO - 10.1016/j.ipl.2018.10.016

M3 - Article

SN - 0020-0190

VL - 142

SP - 68

EP - 71

JO - Information Processing Letters

JF - Information Processing Letters

ER -

On exploring always-connected temporal graphs of small pathwidth

Abstract

Keywords

Access to Document

Fingerprint

Cite this