The betweenness centrality of a vertex v is an important centrality measure that quantifies
how many optimal paths between pairs of other vertices visit v. Computing betweenness …

Abstract An Eulerian walk (or Eulerian trail) is a walk (resp. trail) that visits every edge of a
graph G at least (resp. exactly) once. This notion was first discussed by Leonhard Euler …

Abstract An Eulerian walk (or Eulerian trail) is a walk (resp. trail) that visits every edge of a
graph G at least (resp. exactly) once. This notion was first discussed by Leonhard Euler …

In this contribution we consider a variant of the vertex cover problem in temporal graphs that
has been recently introduced to summarize timeline activities in social networks. The …

We study Steiner Forest on H-subgraph-free graphs, that is, graphs that do not contain some
fixed graph H as a (not necessarily induced) subgraph. We are motivated by a recent …

We study the network untangling problem introduced by Rozenshtein et al.(Data Min. Knowl.
Disc. 35 (1), 213–247, 2021), which is a variant of Vertex Cover on temporal graphs–graphs …

In this paper we study a variant of vertex cover on temporal graphs that has been recently
introduced for timeline activities summarization in social networks. The problem has been …

In this paper we introduce some new algebraic and geometric perspectives on networked
space communications. Our main contribution is a novel definition of a time-varying graph …

Several classical combinatorial problems have been considered and analysed on temporal
graphs. Recently, a variant of Vertex Cover on temporal graphs, called MinTimelineCover …

A temporal graph is a graph whose edges only appear at certain points in time. Reachability
in these graphs is defined in terms of paths that traverse the edges in chronological order …