3 papers
cs.DS2026
Exploration of Always -Connected Temporal Graphs
Duncan Adamson, Paul G Spirakis
\emph{Temporal graphs} are a generalisation of (static) graphs, defined by a sequence of \emph{snapshots}, each a static graph defined over a common set of vertices. \emph{Explorat…
cs.DS2025
Exploring Temporal Graphs with Frequent and Regular Edges
Duncan Adamson
Temporal graphs are a class of graphs defined by a constant set of vertices and a changing set of edges, each of which is known as a timestep. These graphs are well motivated in mo…
cs.DS2025
Exploring Word-Representable Temporal Graphs
Duncan Adamson
Word-representable graphs are a subset of graphs that may be represented by a word over an alphabet composed of the vertices in the graph. In such graphs, an edge exists if and…