3 papers
cs.DC2026
Distributed Triangle and Simplex Enumeration in Hypergraphs
Duncan Adamson, Will Rosenbaum, Paul G. Spirakis
In the last decade, subgraph detection and enumeration have emerged as central problems in distributed graph algorithms. This is largely due to the problems' theoretical challenges…
cs.DS2025
Realizing temporal transportation trees
George B. Mertzios, Hendrik Molter, Nils Morawietz +1
In this paper, we study the complexity of the periodic temporal graph realization problem with respect to upper bounds on the fastest path durations among its vertices. This constr…
cs.DS2025
The Complexity of Transitively Orienting Temporal Graphs
George B. Mertzios, Hendrik Molter, Malte Renken +2
In a temporal network with discrete time-labels on its edges, entities and information can only ``flow'' along sequences of edges whose time-labels are non-decreasing (resp. increa…