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
A temporal graph is a graph in which the edge set can change from step to step. The temporal graph e...
\u3cp\u3eA temporal graph is a graph whose edge set can change over time. We only require that the e...
Temporal graphs are graphs with time-stamped edges. We study the problem of finding a small vertex s...
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 G = (G1, G2,..., GT ) is a graph represented by a sequence of T graphs over a commo...
In this paper we study the fixed-parameter tractability of the problem of deciding whether a given ...
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 is a graph in which the edge set can change from step to step. The temporal graph e...
\u3cp\u3eA temporal graph is a graph whose edge set can change over time. We only require that the e...
Temporal graphs are graphs with time-stamped edges. We study the problem of finding a small vertex s...
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 G = (G1, G2,..., GT ) is a graph represented by a sequence of T graphs over a commo...
In this paper we study the fixed-parameter tractability of the problem of deciding whether a given ...
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 is a graph in which the edge set can change from step to step. The temporal graph e...
\u3cp\u3eA temporal graph is a graph whose edge set can change over time. We only require that the e...
Temporal graphs are graphs with time-stamped edges. We study the problem of finding a small vertex s...
DOI
Add to ORKG