research
∙
06/30/2022
Menger's Theorem for Temporal Paths (Not Walks)
A temporal graph is a graph whose edges are available only at specific t...
share
research
∙
03/12/2021
Königsberg Sightseeing: Eulerian Walks in Temporal Graphs
An Eulerian walk (or Eulerian trail) is a walk (resp. trail) that visits...
research
∙
10/02/2020
Efficient Estimation of Graph Trussness
A k-truss is an edge-induced subgraph H such that each of its edges belo...
research
∙
02/28/2020
Edge-Disjoint Branchings in Temporal Graphs
A temporal digraph G is a triple (G, γ, λ) where G is a digraph, γ is a ...
research
∙
12/31/2019
Proximity Search For Maximal Subgraph Enumeration
This paper considers the subgraphs of an input graph that satisfy a give...
research
∙
03/09/2018