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
\u3cp\u3eA temporal graph is a graph whose edge set can change over time. We only require that the e...
A temporal graph is a sequence of graphs, indexed by discrete time steps, with a fixed vertex set bu...
In this paper we study the fixed-parameter tractability of the problem of deciding whether a given ...
We show that the TEMPORAL GRAPH EXPLORATION PROBLEM is NP-complete, even when the underlying graph h...
We show that the Temporal Graph Exploration Problem is NP-complete, even when the underlying graph h...
We show that the Temporal Graph Exploration Problem is NP-complete, even when the underlying graph h...
A temporal graph with lifetime L is a sequence of L graphs G1, . . . , GL, called layers, all of wh...
AbstractMany network problems are based on fundamental relationships involving time. Consider, for e...
A temporal graph is a graph whose edge set can change over time. We only require that the edge set i...
We introduce a natural temporal analogue of Eulerian circuits and prove that, in contrast with the s...
A temporal graph G = (G1, G2,..., GT ) is a graph represented by a sequence of T graphs over a commo...
Many network problems are based on fundamental relationships involving time. Consider, for example, ...
\u3cp\u3eA temporal graph is a graph whose edge set can change over time. We only require that the e...
A temporal graph is a sequence of graphs, indexed by discrete time steps, with a fixed vertex set bu...
In this paper we study the fixed-parameter tractability of the problem of deciding whether a given ...
We show that the TEMPORAL GRAPH EXPLORATION PROBLEM is NP-complete, even when the underlying graph h...
We show that the Temporal Graph Exploration Problem is NP-complete, even when the underlying graph h...
We show that the Temporal Graph Exploration Problem is NP-complete, even when the underlying graph h...
A temporal graph with lifetime L is a sequence of L graphs G1, . . . , GL, called layers, all of wh...
AbstractMany network problems are based on fundamental relationships involving time. Consider, for e...
A temporal graph is a graph whose edge set can change over time. We only require that the edge set i...
We introduce a natural temporal analogue of Eulerian circuits and prove that, in contrast with the s...
A temporal graph G = (G1, G2,..., GT ) is a graph represented by a sequence of T graphs over a commo...
Many network problems are based on fundamental relationships involving time. Consider, for example, ...
\u3cp\u3eA temporal graph is a graph whose edge set can change over time. We only require that the e...
A temporal graph is a sequence of graphs, indexed by discrete time steps, with a fixed vertex set bu...
In this paper we study the fixed-parameter tractability of the problem of deciding whether a given ...
DOI
Add to ORKG