Add to ORKG\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
A temporal graph G = (G_1, G_2, ..., G_T) is a graph represented by a sequence of T graphs over a co...
The temporal graph exploration problem TEXP is the problem of computing a foremost exploration sched...
We introduce a natural temporal analogue of Eulerian circuits and prove that, in contrast to the sta...
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...
\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 graph in which the edge set can change from step to step. The temporal graph e...
A temporal graph is a graph whose edge set can change over time. We only require that the edge set i...
An always-connected temporal graph G=⟨G1,...,GL⟩ with underlying graph G=(V,E) is a sequence o...
A temporal graph G = (G_1, G_2, ..., G_T) is a graph represented by a sequence of T graphs over a co...
The temporal graph exploration problem TEXP is the problem of computing a foremost exploration sched...
We introduce a natural temporal analogue of Eulerian circuits and prove that, in contrast to the sta...
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...
\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 graph in which the edge set can change from step to step. The temporal graph e...
A temporal graph is a graph whose edge set can change over time. We only require that the edge set i...
An always-connected temporal graph G=⟨G1,...,GL⟩ with underlying graph G=(V,E) is a sequence o...
A temporal graph G = (G_1, G_2, ..., G_T) is a graph represented by a sequence of T graphs over a co...
The temporal graph exploration problem TEXP is the problem of computing a foremost exploration sched...
We introduce a natural temporal analogue of Eulerian circuits and prove that, in contrast to the sta...